Problem Description

In order to make a new word, we will pick out m letters from all the upper case letters and lower case letters(from `a' to `Z'). Therefore, that means you can pick some same letters. But here are two rules:
● as to all the neighbour letters, the absolute value of their ASCII code must be not greater than 32.
● there must be at least one pair of neighbour letters whose absolute value of ASCII code is exactly equal to 32. For example, considering the word in the form like "Xx" or "xX", the neighbour letters have an absolute value of ASCII code exactly equal to 32.
Now how many dierent words can we get?

Input

The first line of input is the number of test case. For each test case, there is only one line contains one integer m(2 ≤ m ≤ 10⁹).

Output

For each test case output one line, just the answer mod 1000000007.

4
2
3
100
7926778

52
4056
533550434
773908369

Author

windy7926778