Problem hidden

ITRIX12E - R Numbers

R - Numbers

R-numbers are numbers which have the property that they do not have the digit '0' and sum of every two adjacent digits of the number is prime. 123 is a R-number because 1+2 =3 and 2+3 =5 and 3, 5 are primes.

How many R-numbers can be formed with at most length N?

i.e. R-numbers of length 1 + R-numbers of length 2 + R-numbers of length 3 + ... R-numbers of length N.

Length of a number = Number of digits in the number.

Only four single digit numbers are R-numbers which are nothing but single digit primes 2, 3, 5, 7.

Input Specification

The first line of the input file contains T which denotes the number of test cases. The next T lines contain an integer N ≤ 109.

Output Specification

Print the numbers of R-numbers modulo 1000000007. [109+7];

Example

Sample Input:
2
1
2

Sample Output:
4
33

Adicionado por:Radhakrishnan Venkataramani
Data:2012-03-12
Tempo limite:1s
Tamanho do fonte:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Linguagem permitida:Todas exceto: ASM64 CLOJURE ERL FSHARP PERL6 PY_NBC SCALA TCL
Origem:Own problem
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.