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.ArrayDeque;
import java.util.ArrayList;
import java.util.Deque;
import java.util.List;
import java.util.Scanner;
import java.util.stream.Collectors;

public class Main {
    private static final int BASE = 55555;

    public static void main(final String[] args) {
        final Scanner scanner = new Scanner(System.in);
        final int n = scanner.nextInt();
        final Deque<Integer> primeNumbers = new ArrayDeque<>(sieveOfEratosthenes(BASE));
    
        final List<Integer> answers = new ArrayList<>();

        for (int i = 0; i < n; i++) {
            int primeNumber;
            while ((primeNumber = primeNumbers.poll()) % 5 != 1) ;
            answers.add(primeNumber);
        }

        final String answer = answers.stream()
                .map(i -> Integer.toString(i))
                .collect(Collectors.joining(" "));

        System.out.println(answer);
    }

    private static List<Integer> sieveOfEratosthenes(final int number) {
        List<Integer> list = new ArrayList<>();
        for (int i = 2; i <= number; i++) {
            list.add(i);
        }

        final int sqrt = (int) Math.sqrt(number);
        final List<Integer> primeNumbers = new ArrayList<>();
        int condition;

        do {
            final int prime = list.get(0);
            primeNumbers.add(prime);
            list = list.stream()
                    .filter(i -> i % prime != 0)
                    .collect(Collectors.toList());
            condition = prime;
        } while (condition < sqrt);

        primeNumbers.addAll(list);
        return primeNumbers;
    }
}
