BETA

Difficulty Level: Easy

Submissions: 6391 Accuracy:

31%

Reach the Nth point

There are N points on the road ,you can step ahead by 1 or 2 . Find the number of ways you can reach at point N. For example:  for n=4 we have 5 possible ways [1,1,1,1]  [1,1,2]  [1,2,1]  [2,1,1]  [2 2].

Input:

The first line of input contains an integer T denoting the number of test cases.Next line of each input contains a single integer N.

Output:

Print the output of each test case in a new line.

Constraints:

1<=T<=100

1<=N<=90

Example:

Input:

2
4
5

Output:

5
8

 

** For More Input/Output Examples Use 'Expected Output' option **

Author: bhawnamait

Set Default Code

					   
It is recommended to 'Compile & Test' your code before clicking 'Submit'!

Compilation/Execution Result:

Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.