#include <bits/stdc++.h>
#include <atcoder/dsu>
using namespace std;
template <class F> class y_combinator {
    F f;

   public:
    y_combinator(F&& f) : f(std::forward<F>(f)) {}
    template <class... Args> auto operator()(Args&&... args) const { return f(*this, std::forward<Args>(args)...); }
};
using ll = long long;
using ld = long double;
template <class T, class U = std::less<T>> using prique = std::priority_queue<T, std::vector<T>, U>;
template <class T> T floor(T a, T b) noexcept { return a / b - (a % b && (a ^ b) < 0); }
template <class T> T ceil(T a, T b) noexcept { return floor(a + b - 1, b); }
template <class T> bool chmin(T& x, const T& y) noexcept { return (x > y ? x = y, true : false); }
template <class T> bool chmax(T& x, const T& y) noexcept { return (x < y ? x = y, true : false); }
#define overload4(a, b, c, d, e, ...) e
#define rep1(a) for (long long _i = 0; _i < (a); _i++)
#define rep2(i, a) for (long long i = 0; i < (a); i++)
#define rep3(i, a, b) for (long long i = (a); i < (b); i++)
#define rep4(i, a, b, c) for (long long i = (a); i < (b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep(i, a, b, c) for (long long i = (a); i > (b); i += (c))
#define all(x) std::begin(x), std::end(x)
#define rall(x) std::rbegin(x), std::rend(x)
#define pb push_back
#ifndef LOCAL
#define debug(...)
#endif

template <int W = 1 << 20>
class Osa_k {
    std::array<int, W> lpf;

   public:
    constexpr Osa_k() {
        for (int x = 2; x < W; x++) {
            if (lpf[x] != 0) continue;
            lpf[x] = x;
            if (x >= (W + x - 1) / x) continue;
            for (int y = x * x; y < W; y += x) {
                if (lpf[y] == 0) lpf[y] = x;
            }
        }
    }

    std::vector<std::pair<int, int>> factor(int x) const {
        assert(1 <= x && x < W);
        std::vector<std::pair<int, int>> res;
        while (x > 1) {
            if (res.empty() || res.back().first != lpf[x]) {
                res.push_back(std::make_pair(lpf[x], 1));
            } else {
                res.back().second += 1;
            }
            x /= lpf[x];
        }
        return res;
    }

    bool is_prime(int x) const {
        assert(1 <= x && x < W);
        if (x == 1) return 0;
        return lpf[x] == x;
    }
};

Osa_k F;
void run_case() {
    int N;
    cin >> N;
    string A = "569 320347 627182 914037 1183708 1414715 1634898 1856323 2048216 2258973 2450090 2630287 2799276 2908009 3027094 3201645 3370832 3488281 3580326 3695063 3801740 3919083 3991922 4057177 4112904";
    vector<int> ans;
    int i = 0;
    while (ans.size() != N) {
        int t = 0;
        while (i < A.size() && isdigit(A[i])) t = t * 10 + A[i++] - '0';
        i += 1;
        ans.pb(t);
    }
    rep(i, ans.size()) cout << ans[i] << " \n"[i == ans.size() - 1];
    // vector<ll> P;
    // rep(x, 405, 1000) if (F.is_prime(x)) P.pb(x);
    // vector<ll> A;
    // rep(i, N) A.pb(P[i]);
    // reverse(all(A));
    // vector<ll> ans;
    // ans.pb(A[0]);
    // rep(i, 1, N) {
    //     ll s = A[i - 1] * A[i];
    //     ll k = (ans.back()) / s + 1;
    //     ans.pb(s * k);
    // }
    // rep(i, ans.size()) cout << ans[i] << " \n"[i == N - 1];
    // vector<int> t;
    // rep(i, N - 1) t.pb(std::gcd(ans[i], ans[i + 1]));
    // debug(t);
}

int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    std::fixed(std::cout).precision(16);
    int T = 1;
    // cin >> T;
    while (T--) run_case();
    return 0;
}