Print a sequence a_1, a_2, ..., a_N whose length is N that satisfies the following conditions:

* a_i (1 \leq i \leq N) is a prime number at most 55 555.
* The values of a_1, a_2, ..., a_N are all different.
* In every choice of five different integers from a_1, a_2, ..., a_N, the sum of those integers is a composite number.



If there are multiple such sequences, printing any of them is accepted.

Constraints

* N is an integer between 5 and 55 (inclusive).

Input

Input is given from Standard Input in the following format:


N


Output

Print N numbers a_1, a_2, a_3, ..., a_N in a line, with spaces in between.

Examples

Input

5


Output

3 5 7 11 31


Input

6


Output

2 3 5 7 11 13


Input

8


Output

2 5 7 13 19 37 67 79
F = range(2, 55556)
primes=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239]
N = int(raw_input())
i = 1
oks = []
while len(oks) < N:
  p = i*10+1
  j = 0
  isPrime = True
  while primes[j]*primes[j] <= p:
    if p % primes[j]==0:
      isPrime = False
      break
    j += 1
  if isPrime:
    oks.append(p)
  i += 1
ans = str(oks[0])
for a in  oks[1:]:
  ans += ' {}'.format(a)
print ans
