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

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = Integer.parseInt(sc.next());
        int cnt = 0;
        for (Integer i : erathosthenes(55555)) {
            if (i%5==2) {
                System.out.println(i);
                for (int j=2;j<i;j++) {
                    if (i%j==0) {
                        System.out.println("err");
                    }
                }
                cnt++;
            }
            if (cnt==N) {
                break;
            }
        }
    }
    public static ArrayList<Integer> erathosthenes(int x) {
        int[] nums = new int[x];
        int[] flag = new int[x];
        for (int i=2;i<x;i++) {
            nums[i]=i;
        }
        for (int i=2;i<Math.sqrt(x);i++) {
            if (flag[i]==1) {
                continue;
            }
            for (int j=2;j*i<x;j++) {
                flag[j*i]=1;
            }
        }
        ArrayList<Integer> ans = new ArrayList<Integer>();
        for (int i=2;i<x;i++) {
            if (flag[i]==0) {
                ans.add(nums[i]);
            }
        }
        return ans;
    }
}