#include<bits/stdc++.h>
using namespace std;

int GCD(int a, int b) {
    if (a % b == 0) return b;
    int r = a % b;
    return GCD(b, r);
}

int main() {
    int n;
    cin >> n;
    vector<int> a = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101};
    vector<int> res(n);
    for (int i = 0; i < n; i++) res[i] = a[n - i - 1] * a[n - i];
    /*for (int i = 0; i < n; i++) cout << res[i] << " ";
    cout << endl;*/
    for (int i = 1; i < n; i++) {
        int x = res[i - 1] / res[i] + 1;
        while(GCD(x, res[i - 1]) != 1) x++;
        res[i] *= x;
    }
    for (int i = 0; i < n; i++) {
        cout << res[i];
        if (i == n - 1) cout << endl;
        else cout << " ";
    }
    /*for (int i = 0; i < n - 1; i++) {
        cout << GCD(res[i], res[i + 1]) << " ";
    }*/
}