PROGRAMMING:Xiao Ming walks on the grid
There are n squares from point a to point B. now Xiaoming wants to go from point a to point B. Xiaoming has eaten something to replenish his physical strength. He can step one grid at a time, two grids at a time, three grids at a time, or four grids at a time. Please write a program to calculate how many ways Xiao Ming has from point a to point B.
###Input format:
The input contains multiple groups of data, the first line is an integer m, m does not exceed 10000, indicating the number of input data groups. Next, m lines, each line is an integer n (ensure that the corresponding output result is less than $$2 ^ {31} $$), which represents the number of grids from point a to point B.
###Output format:
The output is m integers, representing the number of Xiaoming's walk from point a to point B for each group of data.
###Input example:
```in
two
five
three
```
###Output example:
```out
fifteen
four
```
answer：If there is no answer, please comment
###Input format:
The input contains multiple groups of data, the first line is an integer m, m does not exceed 10000, indicating the number of input data groups. Next, m lines, each line is an integer n (ensure that the corresponding output result is less than $$2 ^ {31} $$), which represents the number of grids from point a to point B.
###Output format:
The output is m integers, representing the number of Xiaoming's walk from point a to point B for each group of data.
###Input example:
```in
two
five
three
```
###Output example:
```out
fifteen
four
```
answer：If there is no answer, please comment