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 java.util.Scanner;
import java.util.TreeSet;

public class Main {

    public static void main(String[] args) {
        Scanner cin = new Scanner(System.in);
        int n = cin.nextInt();

        TreeSet<Integer> allPrimes = primes(55555);
        String[] result = new String[n];
        for (int i = 0; i < n; i++) {
            int x;
            do {
                x = allPrimes.pollFirst();
            } while (x % 5 != 1);
            result[i] = Integer.toString(x);
        }
        System.out.println(String.join(" ", result));
    }

    static TreeSet<Integer> primes(int max) {
        TreeSet<Integer> result = new TreeSet<>();
        TreeSet<Integer> seeds = new TreeSet<>();
        int limit = (int)Math.sqrt((double)max);
        result.add(2);
        for (int i = 3; i <= max; i+=2) {
            seeds.add(i);
        }
        while (seeds.size() > 0 && seeds.first() <= limit) {
            int seed = seeds.pollFirst();
            result.add(seed);
            for (int x = seed + seed; x <= max; x+=seed) {
                seeds.remove(x);
            }
        }
        if (seeds.size() > 0) {
            result.addAll(seeds);
        }
        return result;
    }
}
