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

public class Main {
	Scanner sc = new Scanner(System.in);
	int n;
	int len = 55556;
	int[] sosuu = new int[len];
	
	public void run(){
		n = sc.nextInt();
		solve();
	}
	public void solve(){
		
		for(int i = 2; i < len; i++){
			sosuu[i] = 1;
		}
		
		for(int i = 2; i < len; i++){
			if(sosuu[i] == 1){
				int j = i + i;
				while(j < len){
					sosuu[j] = 0;
					j = j + i;
				}
			}
		}
		for(int i = 2; i< len; i++){
			if(i % 5 != 1){
				sosuu[i] = 0;
			}
		}
		
		int num = 0;
		for(int i = 2; i < len; i++){
			if(sosuu[i] == 1){
				System.out.print(i);
				num = num + 1;
				if(num == n){
					break;
				}
				else{
					System.out.print(" ");
				}
			}
		}
	}
	
	
	public static void main(String[] args){
		new Main().run();
	}
	
	static class Pair {
        int first,second;
        public Pair(int a,int b) {
            this.first = a;
            this.second = b;
        }
    }	
}