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.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Main a = new Main();
        a.solve();
    }
    public void solve() {
        Scanner scan = new Scanner(new BufferedReader(new InputStreamReader(System.in)));
        int N = scan.nextInt();
        int[] prime_list = this.get_prime_list();
        List<Integer> answer = new ArrayList<Integer>();
        int count = 0;
        int i = 2;
        for (; i < prime_list.length && count < N; i++) {
            if (prime_list[i] % 5 == 1) {
                answer.add(prime_list[i]);
                count = count + 1;
            }
        }
        StringBuilder sb = new StringBuilder();

        for (int prime : answer) {
            sb.append(prime + " ");
        }
        System.out.println(sb.substring(0, sb.length() - 1));
    }
    private int[] get_prime_list() {
        boolean[] prime = new boolean[55556];
        Arrays.fill(prime, true);
        prime[0] = false;
        prime[1] = false;
        for (int i = 2; i <= 55555; i++) {
            if(!prime[i]) {
                continue;
            }
            for (int j = 2; i * j < 55555; j++) {
                if (55555 < i * j) {
                    break;
                }
                prime[i*j] = false;
            }
        }
        List<Integer> prime_list = new ArrayList<>();
        for (int i = 2; i < 55555; i++) {
            if (prime[i]) {
                prime_list.add(i);
            }
        }
        int[] list = new int[prime_list.size()];
        for (int i = 0; i < prime_list.size(); i++) {
            list[i] = prime_list.get(i);
        }
        return list;
    }
}
