There are n stairs, a person standing at the bottom wants to reach the top. The person can climb either 1 stair or 2 stairs at a time.
Count the total number of ways, the person can reach the top.
Sample Input:
4 (Number of stairs)
Sample Output:
5 (Number of ways)
Explanation:
Way 1: 1-1-1-1-1
Way 2: 1-2-1
Way 3: 2-1-1
Way 4: 1-1-2
Way 5: 2-2
@@coding::1@@