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

public class Main {

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int N = in.nextInt();
		int[] ans = new int[N];
		ans[0] = 2;
		int ansPtr = 1;
		
		int[] prime = new int[1000];
		prime[0] = 2;
		int ptr = 1;
		int num = 3;
		while(ansPtr<N) {
			boolean isPrime = true;
			for(int i=1;i<ptr && prime[i]*prime[i]<=num;i++) {
				if(num%prime[i]==0) {
					isPrime = false;
					break;
				}
			}
			if(isPrime) {
				prime[ptr++] = num;
				if(num%5==1) {
					ans[ansPtr++] = num;
				}
			}
			num += 2;
		}
		
		for(int i=0;i<N;i++) {
			System.out.print(ans[i]+" ");
		}
		
		in.close();

	}

}
