Now that he has grown up,Bit boy can climb atmost N steps at a time. Given the number of steps find the number of ways that he can climb the steps.

Input Format

First line of test case contains T , number of testcases. next T lines contains N , Number of steps.

Output Format

Print Answer for each test case in a newline

Constraints

1<=T<=100 1<=N<=500

Sample Input

2

1

2 Sample Output

1

2

What is a constructive algorithm problem??

http://www.spoj.com/problems/ASSIGN/ I did solve this problem using up-down approach with memoization, but memory required is 2^20. is there any memory efficient way or how to solve when value of N is increased?? The web resources are also of memory O(2^20)

e-maxx.ru/algo is completely in Russian. It is hard for non-Russian to understand. I used Google Translate but still it is not that much clear. I request to translate it for English readable version. It will be beneficial for a mass.