Stepping Numbers

Problem code: STEPNUMS

All submissions for this problem are available.

Call a number stepping if adjacent digits, as well as the first and last digits, differ by one. How many n-digit base 11 stepping numbers are there? Give your answer modulo 4294967143.

For example, 8789A9 is a 6-digit base 11 stepping number. 9A0A and 234 are not stepping.

Input

The first line contains an integer T, the number of test cases (about 20000). Each of the next T lines contains an integer n (2≤ n < 2⁶⁴).

Output

Output the answer to each test case on a separate line.

Example

Input:
4
2
4
6
10

Output:
19
54
171
1958

Date:	2010-07-04
Time limit:	1s
Source limit:	50000B
Languages:	All except: TCL

Submit

Comments

Loading Comments...

SUCCESSFUL SUBMISSIONS FOR THIS PROBLEM:

Loading Submissions...

RECENT ACTIVITY FOR THIS PROBLEM:

Loading Recent Activity...

HELP

Program should read from standard input and write to standard output.

After you submit a solution you can see your results by clicking on the [My Submissions] tab on the problem page. Below are the possible results:

Accepted Your program ran successfully and gave a correct answer. If there is a score for the problem, this will be displayed in parenthesis next to the checkmark.
Time Limit Exceeded Your program was compiled successfully, but it didn't stop before time limit. Try optimizing your approach.
Wrong Answer Your program compiled and ran succesfully but the output did not match the expected output.
Runtime Error Your code compiled and ran but encountered an error. The most common reasons are using too much memory or dividing by zero. For the specific error codes see the help section.
Compilation Error Your code was unable to compile. When you see this icon, click on it for more information.

If you are still having problems, see a sample solution here.