#include <bits/stdc++.h>

void solve() {
    const int N = 25;
    std::vector<int> primes;
    auto is_prime = [](int n) {
        if (n == 1) return false;
        for (int i = 2; i * i <= n; i++) {
            if (n % i == 0) return false;
        }
        return true;
    };
    for (int i = 2; i <= 1000000; i++) {
        if (is_prime(i)) primes.push_back(i);
    }
    std::vector<int> ans(N, 1);
    for (int i = 0; i + 1 < N; i++) {
        ans[N - i - 1] *= primes[i];
        ans[N - i - 2] *= primes[i];
    }

    int prev_prime = primes[N - 2];
    for (int i = 1; i < N; i++) {
        if (ans[i - 1] < ans[i]) continue;
        int diff = ans[i - 1] / ans[i];
        auto it = std::ranges::upper_bound(primes, std::max(prev_prime, diff));
        prev_prime = *it;
        ans[i] *= *it;
    }

    auto check = [](int n, const std::vector<int>& ans) {
        const int MAX = 1e8;
        for (int i = 0; i < n; i++) {}
        for (int i = 0; i + 1 < n; i++) {}
        for (int i = 0; i + 2 < n; i++) {}
    };
    check(N, ans);
    int n;
    std::cin >> n;
    for (int i = 0; i < n; i++) {
        std::cout << ans[i] << (i + 1 == n ? '\n' : ' ');
    }
}

int main() {
    std::cin.tie(0)->sync_with_stdio(0);
    std::cout << std::fixed << std::setprecision(16);
    int t = 1;

    while (t--) solve();
}