Count Ways to Reach the N-th Stair Problem Statement

You are provided with a number of stairs, and initially, you are located at the 0th stair. You need to reach the Nth stair, and you can climb one or two steps at a time. Your task is to determine the number of distinct ways to climb from the 0th to the Nth stair.

Input:

The first line contains an integer 'T', denoting the number of test cases. For each test case, there is a single integer 'N' which represents the number of stairs.

Output:

For each test case, print the number of distinct ways to reach the Nth stair, modulo 10^9+7. The result for each test case should be on a new line.

Example:

Input:

N=3

Output:

The number of distinct ways to reach the 3rd stair is 3, considering all possible sequences of climbing as shown in the example.

Constraints:

• 1 <= T <= 100
• 0 <= N <= 10^18

Note:

You are not required to print anything yourself; the output handling is managed by the system.