PROGRAMMING:Super staircase 1
##### Problem Description
There's a super staircase. It's infinite. When you're on the ground at the beginning, you can step up the first level, or you can step up the second level.
Suppose you can only step up one or two levels at a time, then how many ways do you have to go up to level n?
##### Input
The input data first contains an integer n, representing the number of test cases, and then n lines of data, each line contains an integer m (1 < = m < = 40), representing the number of stairs.
##### Output
For each test case, please output the number of different methods
##### Sample Input
```in
two
five
eight
```
##### Sample Output
```out
two
eight
thirty-four
```
answer：If there is no answer, please comment
There's a super staircase. It's infinite. When you're on the ground at the beginning, you can step up the first level, or you can step up the second level.
Suppose you can only step up one or two levels at a time, then how many ways do you have to go up to level n?
##### Input
The input data first contains an integer n, representing the number of test cases, and then n lines of data, each line contains an integer m (1 < = m < = 40), representing the number of stairs.
##### Output
For each test case, please output the number of different methods
##### Sample Input
```in
two
five
eight
```
##### Sample Output
```out
two
eight
thirty-four
```
answer：If there is no answer, please comment