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.*;
import java.io.*;

public class Main {
    public static boolean isPrime(int p){
    	if(p%2==0) return false;
    	for(int i=3;i*i<=p;i+=2){
    		if(p%i==0) return false;
    	}
    	return true;
    }
    public static void arrayPrint(int[] array){
    	for(int i=0;i<array.length-1;i++) System.out.print(array[i]+" ");
    	System.out.println(array[array.length-1]);
    }
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int[] primes = new int[N];
        int written = 0;
        for(int k=1;k<=5555;k++){
        	if(isPrime(10*k+1)){
        		primes[written]=10*k+1;
        		written++;
        	}
        	if(written>=N) break;
        }
        arrayPrint(primes);
    }
}