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.StringJoiner;

public class Main implements Runnable {

    private static Scanner sc = new Scanner(System.in);

    public static void main(String[] args) {
        new Thread(null, new Main(), "", 128 * 1024 * 1024).start();
    }

    public void run() {
        int n = sc.nextInt();
        int[] arr = new int[n];
        int count = 0;
        int i;
        for (i = 3; count < n && i <= 55_555; i += 2) {
            boolean tmp = true;
            if (i % 5 != 1) {
                tmp = false;
            }
            if (tmp) {
                for (int j = 3; j <= Math.sqrt(i); j += 2) {
                    if (i % j == 0) {
                        tmp = false;
                        break;
                    }
                }
            }
            if (tmp) {
                arr[count] = i;
                count++;
            }
        }
        StringJoiner sj = new StringJoiner(" ");
        for (int prime : arr) {
            sj.add(String.valueOf(prime));
        }
        System.out.println(sj.toString());
    }
}