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;
 
public class Main {
 
    static int n;
    static boolean[] primes;
 
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        n = sc.nextInt();
 
        sieve();
 
        solve();
    }
 
    static void solve() {
        int count = 0;
        for (int i = 5; i < primes.length; i++) {
            if (!primes[i]) {
                continue;
            }
 
            if (i % 5 == 1) {
                count++;
                if (count != n) {
                    System.out.print(i + " ");
                } else {
                    System.out.println(i);
                    break;
                }
            }
        }
    }
 
    static void sieve() {
        int n = 55555;
 
        final int MAX = n + 1;
        primes = new boolean[MAX];
 
        for (int i = 3; i < MAX; i+=2) {
            primes[i] = true;
        }
        primes[2] = true;
 
        for (int i = 3; i <= Math.sqrt(MAX); i += 2) {
            if (primes[i]) {
                for (int j = i*2; j < MAX; j += i) {
                    primes[j] = false;
                }
            }
        }
    }
}