Ankita has to climb 5 stairs starting at the ground, while respecting the following rules:
At any stage, Ankita can move either one or two stairs up.
At any stage, Ankita cannot move to a lower step.
Let $F(N)$ denote the number of possible ways in which Ankita can reach the $N^{\text{th}}$ stair. For example, $F(1)=1$, $F(2)=2$, $F(3)=3$.
The value of $F(5)$ is ____________.