Package for this problem was not updated by the problem writer or Codeforces administration after we’ve upgraded the judging servers. To adjust the time limit constraint, solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then value 800 ms will be displayed and used to determine the verdict.

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

E. Polycarpus the Safecracker

time limit per test

3 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputPolycarpus has *t* safes. The password for each safe is a square matrix consisting of decimal digits '0' ... '9' (the sizes of passwords to the safes may vary). Alas, Polycarpus has forgotten all passwords, so now he has to restore them.

Polycarpus enjoys prime numbers, so when he chose the matrix passwords, he wrote a prime number in each row of each matrix. To his surprise, he found that all the matrices turned out to be symmetrical (that is, they remain the same after transposition). Now, years later, Polycarp was irritated to find out that he remembers only the prime numbers *p*_{i}, written in the first lines of the password matrices.

For each safe find the number of matrices which can be passwords to it.

The number of digits in *p*_{i} determines the number of rows and columns of the *i*-th matrix. One prime number can occur in several rows of the password matrix or in several matrices. The prime numbers that are written not in the first row of the matrix may have leading zeros.

Input

The first line of the input contains an integer *t* (1 ≤ *t* ≤ 30) — the number of safes. Next *t* lines contain integers *p*_{i} (10 ≤ *p*_{i} ≤ 99999), *p*_{i} is a prime number written in the first row of the password matrix for the *i*-th safe. All *p*_{i}'s are written without leading zeros.

Output

Print *t* numbers, the *i*-th of them should be the number of matrices that can be a password to the *i*-th safe. Print the numbers on separate lines.

Examples

Input

4

11

239

401

9001

Output

4

28

61

2834

Note

Here is a possible password matrix for the second safe:

239

307

977

Here is a possible password matrix for the fourth safe:

9001

0002

0002

1223

Codeforces (c) Copyright 2010-2017 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Oct/23/2017 14:33:13 (c2).

Desktop version, switch to mobile version.

User lists

Name |
---|