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.ArrayList;
import java.util.Scanner;

public class Main 
{
	static int MAX = 222220;
	static boolean[] sieve = new boolean[MAX+1];
	static int[] primes = new int[5637];
	
	public static void main(String[] args) 
	{
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		
		sieve[0] = true;
		sieve[1] = true;
		for(long i = 2; i <= MAX; i++)
		{
			if(!sieve[(int)i])
				for(long j = i*i; j <= MAX; j+=i)
				{
					sieve[(int)j] = true;
				}
		}
		int f = 55555;
		int pr = 0;
		for(int i = 2; i <= f; i++)
		{
			if(pr >=5637)break;
			if(!sieve[i])
			{
				primes[pr] = i;
				pr++;
			}
		}
//		System.out.println(Arrays.toString(primes));
//		System.out.println(pr);
		
		ArrayList<Integer> l = new ArrayList<>();
		
		StringBuilder sb = new StringBuilder();
		int cur = 0;
		while(l.size()<n)
		{
			long curp = primes[cur];
			while(primes[cur]%5!=1)cur++;
			curp = primes[cur];
			l.add(primes[cur]);
			if(l.size()>1)sb.append(' ');
			sb.append(primes[cur]);
			cur++;
		}
		
		System.out.println(sb);
			
	}

}
