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.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;

class Main{
    public static void main(String[] args) throws IOException{
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        boolean[] isPrime = new boolean[55556];

        for(int i = 4; i < 55556; i+=2){
            isPrime[i] = true;
        }

        for(int i = 3; i < 55556; i+=2){
            if(!isPrime[i]){
                for(int j = i*2; j < 55556; j+=i){
                    isPrime[j] = true;
                }
            }
        }

        int n = Integer.parseInt(br.readLine());
        int count = 2; 

        System.out.print("11");
        for(int i = 13; i < 55556 && count <= n; i+=2){
            if(!isPrime[i] && i%10 == 1){
                count++;
                System.out.print(" " + i);
            }
        }


    }
}