Problem: 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

Solution (in JAVA):

Solution:
import java.util.*;

public class Main {
	public static void main(String[] args) {
		Scanner in = new Scanner (System.in);
		int k = in.nextInt();
		int[] primes = new int[k];
		int item = 0;
		String numString = "";
		for ( int i = 3; i < 55555; i++ ) {
			if (item == k)
				break;
			numString = Integer.toString(i);
			if (isPrime(i) && numString.charAt(numString.length()-1) == '1' ) {
				primes[item] = i;
				item++;
			}
		}
		
		String fin = "";
		
		for ( int i = 0; i < k; i++ ) {
			fin += primes[i];
			if ( i != k-1 )
				fin += " ";
		}
		System.out.println(fin);
		// System.out.println(Arrays.toString(primes));
	}
	
	public static boolean isPrime(int n) {
		// for ( int i = 2; i*i <= n; i++ ) {
		for ( int i = 2; i < n ; i++ ) {
			if ( n%i == 0 )
				return false;
		}
		return true;
	}

}