PROGRAMMING:Small Taotao series 123
When young Taotao first entered kindergarten, he was deeply fascinated by the wonderful numbers. He even took the stairs to count the grid, 1,2,3,4....
One day, on a whim, he wanted to know how many ways he could get to the top of the steps. Small Taotao could walk one space at a time, or jump two spaces at a time.
###Input format:
Enter an integer n (n < = 40).
Given that there are n steps in total, small Taotao starts from grid 0.
###Output format:
There are several ways to get to the top.
###Input example:
Here is a set of inputs. For example:
```in
three
five
```
###Output example:
The corresponding output is given here. For example:
```out
three
eight
```
answer：If there is no answer, please comment
One day, on a whim, he wanted to know how many ways he could get to the top of the steps. Small Taotao could walk one space at a time, or jump two spaces at a time.
###Input format:
Enter an integer n (n < = 40).
Given that there are n steps in total, small Taotao starts from grid 0.
###Output format:
There are several ways to get to the top.
###Input example:
Here is a set of inputs. For example:
```in
three
five
```
###Output example:
The corresponding output is given here. For example:
```out
three
eight
```
answer：If there is no answer, please comment