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 number of ways, the person can reach the top (order does matter).
The first line contains an integer 'T' denoting the total number of test cases. In each test cases, an integer N will be given.
For each testcase, in a new line, print number of possible ways to reach Nth stair. Answer your output % 10^9+7.
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.