A15407 | $Factorise N+M$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

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

输出 #1

2
7
47837

C++ 编辑器

输入

输出