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

class Main {

    private final  ArrayList<Integer> primes = new ArrayList<Integer>();
    private final  ArrayList<Integer> targets = new ArrayList<Integer>();
    private final int n;

    public Main(int n) {
        this.n = n;
    }

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        if (scanner.hasNextLine()) {
            int N = Integer.parseInt(scanner.nextLine());

            new Main(N).start();
        }
    }

    private void start() {
        targets.add(3);
        for (int i = 1; true; ++i) {
            if (addAndCheck(i * 6 - 1)) {
                break;
            }
            if (addAndCheck(i * 6 + 1)) {
                break;
            }
        }

        StringBuilder builder = new StringBuilder();
        for (int i : targets) {
            if (builder.length() > 0) {
                builder.append(' ');
            }
            builder.append(i);
        }

        System.out.println(builder);
    }

    private boolean addAndCheck(int num) {
        if (isPrime(num)) {
            primes.add(num);
            if (num % 10 == 3) {
                targets.add(num);
                if (targets.size() >= n) {
                    return true;
                }
            }
        }

        return false;
    }

    private boolean isPrime(int num) {
        for (int i : primes) {
            if (num % i == 0) {
                return false;
            }
            if (num <= i * i) {
                return true;
            }
        }
        return true;
    }
}