PROGRAMMING:The frog jumps the steps

A frog can jump up one or two steps at a time. Find out how many ways the frog can jump on an n-step.
###Input format:
First, input the number n, which means that there are n groups of input, 50 > = n > = 0, and then a number in each line, which represents the number of steps, is an integer less than 60
###Output format:
For each group of input, output frog jump.
###Input example:
```in
three
one
two
three
```
###Output example:
```out
one
two
three
```







answer：If there is no answer, please comment