Given N, count the number of ways to express N as sum of 1, 3 and 4.

**Input: **

The first line of the input contains a single integer **T**, denoting the number of test cases. Then **T** test case follows, a single line of the input containing a positive integer N.

**Output: **

For each test case, print number of ways to express N and print under modulo 10^9+7.

**Constraints:**

1<=T<=100

1<=N<=10000

**Example:**

**Input:**

2

4

5

**Output:**

4

6

Explanation:

Test Case 1: For N = 4, we can expres 4 in { 1+1+1+1} {1+3} {3+1} {4} So, total no. of ways are 4.