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

public class Main {
  public static void main (String[] args) {
    Scanner sc = new Scanner(System.in);
    int N = sc.nextInt();
    int[] arr = primeArray();
    int[] fin = new int[N];
    for(int i = 0; i < N; i++) {
      fin[i] = arr[i];
    }
    String out = "";
    for(int curr : fin)
      out += curr + " ";
    System.out.println(out.substring(0, out.length()-1));
  }
  
  /*public static boolean checkIf5(int[] n) {
    int sum = 0;
    for(int curr : n) {
      sum += curr;
    }
    return sum % 5 == 0;
  }*/
  
  public static int[] primeArray() {
    int[] primes = new int[10000];
    primes[0] = 2;
    int ind = 1;
    for(int i = 3; i <= 55555; i += 2) {
      if(isPrime(i) && i % 10 == 7) {
        primes[ind] = i;
        ind++;
      }
    }
    return primes;
  }
  
  public static boolean isPrime(int n) {
    for(int i = 2; i*i < n; i++) {
      if(n % i == 0)
        return false;
    }
    return true;
  }
  
  public static int returnSum(int[] n) {
    int sum = 0;
    for(int i = 0; i < n.length; i++)
      sum += n[i];
    return sum;
  }
}
