#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
const int N = 2000086, MOD = 1e9 + 7, INF = 0x3f3f3f3f;
ll res;
int n, m, cnt, w[N];

ll lcm(ll a, ll b) { return a * b / __gcd(a, b); }

int main() {
	cin >> n;
	w[1] = 2, w[2] = 3, w[3] = 5, w[4] = 7, w[5] = 11, w[6] = 13;
	w[7] = 17, w[8] = 19, w[9] = 23;
	for (int i = 1; i < n + 1; i++) {
		ll sum = 1;
		for (int j = 1; j <= 9; j++)
			if (i != j)
				sum *= w[j];
		printf("%lld ", sum);
	}
	return 0;
}