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 { // https://atcoder.jp/contests/abc096/tasks/abc096_d
	static ArrayList<Integer> primes = new ArrayList<Integer>();
	
	static boolean isPrime(int x) {
		if (x == 2 || x == 3) return true;
		if (x < 2) return false;
		
		for (int i = 2; i * i <= 2 * x; i++) {
			if (x % i == 0) return false;
		}
		return true;
	}
	
	static void init(int psize, int modd) {
		int cur = modd;
		while (primes.size() < psize) {
			if (isPrime(cur)) primes.add(cur);
			
			cur += 5;
		}
	}
	
	public static void main(String[] args) { 
		Scanner x = new Scanner(System.in);
		int n = x.nextInt();
		long start = System.nanoTime();
		init(n, 2); // SIKE its actually 2 mod 5 you just got trolled
	//	System.out.println((System.nanoTime() - start) / 1000000);
		
		for (int i : primes) System.out.print(i + " ");
	}
}
