#include <bits/stdc++.h>
// #include <x86intrin.h>
using namespace std;
#if __cplusplus >= 202002L
using namespace numbers;
#endif



int main(){
	cin.tie(0)->sync_with_stdio(0);
	cin.exceptions(ios::badbit | ios::failbit);
	int n;
	cin >> n;
	vector<int> a(n);
	a[n - 1] = 1 << __lg(100'000'000);
	a[n - 2] = a[n - 1] / 2;
	vector<array<int, 2>> dif(n - 1);
	dif[n - 2] = {1, 2};
	for(auto i = n - 3; i >= 0; -- i){
		int num = dif[i + 1][1];
		while(gcd(a[i + 1], num) != 1 || 1LL * num * a[i + 1] <= lcm<long long>(a[i + 1], a[i + 2])){
			++ num;
		}
		int den = num + 1;
		while(a[i + 1] % den){
			++ den;
		}
		dif[i] = {num, den};
		a[i] = a[i + 1] / den * num;
	}
	ranges::copy(a, ostream_iterator<int>(cout, " "));
	cout << endl;
	assert(ranges::max(a) <= 100'000'000);
	for(auto i = 0; i < n - 1; ++ i){
		assert(a[i] < a[i + 1]);
	}
	for(auto i = 1; i < n - 1; ++ i){
		assert(lcm<long long>(a[i - 1], a[i]) > lcm<long long>(a[i], a[i + 1]));
	}
	return 0;
}

/*
19 17 13 11 7  5  3
 1  2  4 8 16 32 64
a<b<c
 g h
ab/g > bc/h
a/g > c/h

13 11 9 7 5
1 2 4 8 16
*/