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.*;

class Main{
	public static void main(String[] args){
		int p=0;
		Scanner sc=new Scanner(System.in);
        int N=sc.nextInt();
        
        List<Integer> arr = Main.sieve(55555);
        List<Integer> arr2 = new ArrayList<Integer>();
        for(int i = 0; i < arr.size(); i++) {
        	if(arr.get(i) % 5 == 1) arr2.add(arr.get(i));
        }
        for(int i = 0; i < N; i++) {
        	System.out.print(arr2.get(i) + " ");
        }
	}

	static List<Integer> sieve(int N) {
		List<Integer> arr = new ArrayList<Integer>();
		arr.add(2);
		for(int i = 3; i < N; i++) {
			boolean flag = true;
			
			int k = 0;
			while(flag && k < arr.size()) {
				if(i % arr.get(k) == 0) {
					flag = false;
				}
				k++;
			}
			if(flag) {
				arr.add(i);
			}
		}
		return arr;
	}
}