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=sc.nextInt();
		int[] pri=new int[300000];
		int[] pri_true=new int[300000];
		int k=0;

		for(int i=1;i<300000;i++){
            pri[i] = i;
        }
        for(int i=2;i<300000;i++){
            for(int j=i+i;j<300000;j+=i){
                pri[j]=0;
            }
        }

		for(int i=2;i<300000;i++){
			//素数をpri_trueに格納
			if(pri[i]!=0 && pri[i]%10==1){
				pri_true[k]=pri[i];
				k++;
			}
		}

		for(int i=0;i<n;i++){
        	System.out.print(pri_true[i]+" ");
        }

        System.out.println();

	}
}