|All-time Popular Problems|
|Inorder Successor in BST|
|Depth First Traversal for a Graph|
|Delete nodes having greater value on right|
|Column name from a given column number|
|Search an Element in an array|
|Diameter of Binary Tree|
|Get minimum element from stack|
|Subset Sum Problem|
|Reverse words in a given string|
|Reverse a linked list|
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.
Print the output of each test case in a new line.