PROGRAMMING:JOJO loves math

Dongfang Zhanzhu encountered a mathematical problem. Given a number n, we define such an equation:
N = a [1] + a [2] + a [3] + ... + a [m];
a [i]> 0,1 <= m <= N;
My question is how many different equations can you find for a given n.
For example, suppose n is 4
4 = 4;
4 = 3 + 1;
4 = 2 + 2;
4 = 2 + 1 + 1;
4 = 1 + 1 + 1 + 1;
So when n is 4, the result is 5,
After thinking for a long time, Zhan Zhu still couldn't, so he began to ask for help from the invincible chengtaro: "chengtaro, use your invincible platinum star to find a way.".
And do you know the answer as the invincible platinum star?
###Input format:
Input a T in the first line, T input examples
Enter an integer n (1 < = n < = 1E4) in the following T line,.
###Output format:
For each test case, you must output a line containing the integer P, which indicates that the different equation p you find modulates 1e9 + 7.
###Input example:
Here is a set of inputs. For example:
```in
three
four
ten
twenty
```
###Output example:
The corresponding output is given here. For example:
```out
five
forty-two
six hundred and twenty-seven
```







answer：If there is no answer, please comment