PROGRAMMING:Xiaohang steps

In Xiaohang school, there is a long staircase, which Xiaohang passes every class. Xiaohang found that his steps could be one step or two at a time. Xiaohang wants to know how many ways there are.
###Input format:
Input an integer n (0 < n < 11) in the first line, indicating that there are n groups of test data;
In the next n rows, each row gives an integer t (0 < n < 31), which indicates that there are t steps in total;
###Output format:
For each group of inputs, how many ways to output in a row.
###Input sample 1:
Here is a set of inputs. For example:
```in
one
two
```
###Output sample 1:
The corresponding output is given here. For example:
```out
two
```
###Input sample 2:
Here is a set of inputs. For example:
```in
two
two
three
```
###Output sample 1:
The corresponding output is given here. For example:
```out
two
three
```







answer：If there is no answer, please comment