#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;
	for(auto i = n - 2; i >= 1; -- i){
		a[i] = (2 * (n - 2 - i) + 1) * (2 * (n - 2 - i) + 3);
	}
	a[0] = 2 * n - 3;
	for(auto i = 1; i < n; ++ i){
		if(a[i - 1] >= a[i]){
			int x = a[i];
			int pg = gcd(a[i - 1], a[i]);
			int ng = i + 1 < n ? gcd(a[i], a[i + 1]) : 0;
			while(a[i] <= a[i - 1] || gcd(a[i - 1], a[i]) != pg || i + 1 < n && gcd(a[i], a[i + 1]) != ng){
				a[i] += x;
			}
		}
	}
	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(gcd(a[i - 1], a[i]) > gcd(a[i], a[i + 1]));
	}
	return 0;
}

/*

*/