X was given a maths homework consisting of N problem. The problems are quite hard so X can do atmost 2 problems in a day. He will either solve 1 problem or 2 problems in one day. While X is busy doing the homework, He asks you calculate the number of ways to do N problems.
INPUT
First line of the input contains an integer T denoting the number of testcases. The description of T testcases is as follows:
Each test case contains only one integer N - denoting the number of no. of problems to solve.
OUTPUT
For each testcase output a single integer denoting the number of ways through which you can solve exactly N problems(no more, no less).
CONSTRAINTS
1<=T<=10^5
1<=N<=80
Test 1: There's only one way to do 1 problem.
Test 2: There are 5 possible ways.
1->2->3->4
1->2-> 4
1->3->4
2->3->4
2->4
Please login to use the editor
You need to be logged in to access the code editor
Loading...
Please wait while we load the editor
No editorial available for this problem.
Please login to use the editor
You need to be logged in to access the code editor
Loading...
Please wait while we load the editor