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
import sys
from collections import deque
import copy
import math
def get_read_func(fileobject):
    if fileobject == None :
        return raw_input
    else:
        return fileobject.readline



def main():
    if len(sys.argv) > 1:
        f = open(sys.argv[1])
    else:
        f = None
    read_func = get_read_func(f);
    input_raw = read_func().strip().split()
    [N] = [int(input_raw[0])]
    primes = []
    for i in range(2, 55556):
        is_prime = True
        for j in range(2, int(math.sqrt(i) ) + 1):
            if i % j == 0:
                is_prime = False
                break
        if is_prime == True:
            primes.append(i)
    #print primes, len(primes)

    ok_list = []
    for p in primes:
        if (p - 1) % 6 == 0 and (p - 1) % 5 == 0:
            ok_list.append(p)

    for i in range(N):
        print ok_list[len(ok_list) - 1 - i],


if __name__ == '__main__':
    main()
