In this problem you have to count the number of great numbers of length n. Here a great number must have the following property:
The first line of the input file contains an integer T (T ≤ 40) which denotes the total number of test cases.
The description of each test case is given below:
An integers N (1 ≤ N ≤ 40).
For each case you have to output the number of great numbers in a single line. Print the output modulo 1000007.
2 1 2
6 10