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.


-----Input-----

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$).


-----Output-----

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.


-----Examples-----

Input
3
7
2
75619
Output
2
7
47837


-----Note-----

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.

Difficulty: EASY
Tags: Number theory

Constructive algorithms

Starter code:

Solutions:
print(*[*open(0)][1:])


import sys
input = sys.stdin.readline
from math import ceil, comb
list_input = lambda x=int: list(map(x, input().strip().split()))
mult_input = lambda x=int: map(x, input().strip().split())

def solve():
	n = int(input())
	return n
for _ in range(int(input())):
	print(solve())


import sys
input = sys.stdin.readline

def inp():
	return int(input())

def inlt():
	return list(map(int, input().split()))

def insr():
	s = input()
	return list(s[:len(s) - 1])

def invr():
	return map(int, input().split())
test_cases = inp()
inp_arr = [inp() for i in range(test_cases)]

def findM(n):
	return n
result = [findM(n) for n in inp_arr]
for m in result:
	print(m)


a = int(input())
sp = []
for i in range(a):
	b = int(input())
	sp.append(b)
for i in sp:
	print(i)


n = int(input())
list = []
for _ in range(n):
	x = int(input())
	list.append(x)
for i in list:
	print(i)


from operator import mod
import sys
from math import *
from collections import defaultdict, deque
input = sys.stdin.readline
mod = 10 ** 9 + 7
INF = 1061109567
N = int(2 * 10 ** 5 + 5)
LINF = 4557430888798830399

def solve():
	n = int(input())
	print(n)
T = int(input())
for t in range(T):
	solve()


def funct1(n):
	return n
t = int(input())
data = []
for i in range(t):
	x = int(input())
	data.append(x)
for i in data:
	print(funct1(i))


t = int(input())
while t > 0:
	n = int(input())
	print(n)
	t = t - 1


def solve():
	return input()
t = int(input())
for _ in range(t):
	print(solve())


t = int(input())
for _ in range(t):
	print(input())


for i in range(int(input())):
	n = int(input())
	print(n)


I = input
for i in range(int(I())):
	print(I())


for _ in range(int(input())):
	n = int(input())
	print(n)


def getint():
	return [int(i) for i in input().split()]

def get():
	return int(input())

def S():
	for test in range(int(input())):
		solve()

def solve():
	n = get()
	print(n)
S()


T = int(input())
for tt in range(T):
	n = int(input())
	print(n)


for ooo in range(int(input())):
	t = int(input())
	print(t)