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.*;
import java.util.regex.*;

public class Main {
	
	public static void main(String... args) {
		System.out.println(toString(genPrimes(55555, scanInt())));
	}
	
	private static String toString(int... nums) {
		StringBuilder buff = new StringBuilder();
		for (int n : nums) {
			if (0 < buff.length()) buff.append(' ');
			buff.append(n);
		}
		return buff.toString();
	}
	
	private static int[] genPrimes(int max, int N) {
		int[] primes = new int[N];
		int p = 0;
		for (int i = 11; i <= max && p < N; i += 2) {
			if (i % 5 != 1) continue;
			if (isPrime(i)) {
				primes[p] = i;
				++p;
			}
		}
		return primes;
	}
	
	private static boolean isPrime(int n) {
		int m = n / 3;
		for (int i = 3; i < m; i += 2) {
			if (n % i == 0) {
				return false;
			}
		}
		return true;
	}

	private static final Scanner SC = new Scanner(System.in);

	private static int scanInt() {
		return SC.nextInt();
	}

	private static  String scanString() {
		return SC.next();
	}
}
