[Solution] Factorise N+M Codeforces Solution

A. Factorise N+M

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Pak Chanek has a prime number†${}^{†}$ 𝑛$n$. Find a prime number 𝑚$m$ such that 𝑛+𝑚$n+m$ is not prime.

†${}^{†}$ A prime number is a number with exactly 2$2$ factors. The first few prime numbers are 2,3,5,7,11,13,…$2,3,5,7,11,13,\dots$. In particular, 1$1$ is not a prime number.

Input

Each test contains multiple test cases. The first line contains an integer 𝑡$t$ (1≤𝑡≤104$1\le t\le {10}^4$) — the number of test cases. The following lines contain the description of each test case.

The only line of each test case contains a prime number 𝑛$n$ (2≤𝑛≤105$2\le n\le {10}^5$).

Output

For each test case, output a line containing a prime number 𝑚$m$ (2≤𝑚≤105$2\le m\le {10}^5$) such that 𝑛+𝑚$n+m$ is not prime. It can be proven that under the constraints of the problem, such 𝑚$m$ always exists.

If there are multiple solutions, you can output any of them.

Note

In the first test case, 𝑚=2$m=2$, which is prime, and 𝑛+𝑚=7+2=9$n+m=7+2=9$, which is not prime.

In the second test case, 𝑚=7$m=7$, which is prime, and 𝑛+𝑚=2+7=9$n+m=2+7=9$, which is not prime.

In the third test case, 𝑚=47837$m=47837$, which is prime, and 𝑛+𝑚=75619+47837=123456$n+m=75619+47837=123456$, which is not prime.