CF1740A.Factorise N+M

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

Pak Chanek has a prime number $^\dagger$ $n$ . Find a prime number $m$ such that $n + m$ is not prime.

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

输入格式

Each test contains multiple test cases. The first line contains an integer $t$ ( $1 \leq t \leq 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 \leq n \leq 10^5$ ).

输出格式

For each test case, output a line containing a prime number $m$ ( $2 \leq m \leq 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.

输入输出样例

输入#1
```
3
7
2
75619
```
输出#1
```
2
7
47837
```

说明/提示

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

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

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

首页