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

public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		
		int n = Integer.parseInt(sc.next());
		
		int m = 55555;
		BitSet p = new BitSet(55556);
		
		for(int i = 2 ; i <= m ;i++) {
			for(int j = 2 ; j <= Math.sqrt(i) ; j++) {
				if(i % j == 0) {
					p.set(i);
				}
			}
		}
		List <Integer> L = new ArrayList<Integer>();
		
		for(int i = 2 ; i <= m ;i++) {
			if(!p.get(i)) {
				L.add(i);
			}
		}
		int []prime = new int [L.size()];
		int []num = new int [5];
		int N = L.size();
		
		for(int i = 0 ;i < N;i++) {
			prime[i] = L.get(i);
			num[(prime[i]%5)]++;
 		}
	
		int max = 0; 
		int index = 0;
		
		int cnt = 0;
		for(int i = 0 ; i < N ;i++) {
			if(prime[i] % 5 == 1) {
				System.out.println(prime[i]);
				cnt++;
			}
			if(cnt == n) {
				return;
			}
		}
	}

}
