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].
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.
For each testcase, in a new line, print the number of ways.
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.