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();
		sc.close();
		
		//エラトステネスの篩により、素数を列挙する。
		int sieves[] = sieve(55555);
		
		List<Integer> primes_end1 = new ArrayList<Integer>();
		for(int i=0;i<sieves.length;i++) {
			if(sieves[i]==1&&i%5==1)primes_end1.add(i);
		}
		
		StringBuilder sb = new StringBuilder();
		for(int i=0;i<N;i++) {
			sb.append(primes_end1.get(i)+" ");
		}
		System.out.println(sb.toString());
	}
	
	//引数以下の素数を列挙し返すメソッド
	static int[] sieve(int N) {
		int primes[] = new int[N+1];
		Arrays.fill(primes, -1);
		primes[0]=primes[1]=0;
		for(int i=2;i<=N;i++) {
			if(primes[i]==-1) {
				primes[i]=1;
				for(int j=2*i;j<=N;j+=i) primes[j]=0;
			}
		}
		return primes;
	}
}
