#include <cstdio>
#include <iostream>

using namespace std;

#define N 12

typedef long long LL;

LL primes[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41};

int main() {
    freopen("house.in", "r", stdin);
    freopen("house.out", "w", stdout);

    int n;
    cin >> n;

    LL start = 1;
    for (int i = 0; i < N; i++)
        start *= primes[i];

    for (int i = 0; i < N; i++)
        for (int j = i + 1; j < N; j++)
            for (int k = j + 1; k < N; k++)
                for (int l = k + 1; l < N; l++) {
                        LL number = start * primes[i] * primes[j] * primes[k] * primes[l];

                        cout << number << " ";
                        n--;
                        if (!n) return 0;
                    }

    cerr << n << endl;

    return 0;
}