#include <bits/stdc++.h>
using namespace std;
 
int main() {
	ios::sync_with_stdio(0), cin.tie(0);
	int N; cin >> N;
	vector<int> pfac(N+1);
	vector<int> primes; primes.reserve(N-1);
	vector<int> vals; vals.reserve(N-1);
	for (int i = 2; i <= N; i++) {
		if (!pfac[i]) {
			primes.push_back(i);
			pfac[i] = i;
		}
		vals.push_back(i/pfac[i]);
		for (int p : primes) {
			if (i*p > N || p > pfac[i]) break;
			pfac[i*p] = p;
		}
	}
 
	sort(vals.begin(), vals.end());
	assert(int(vals.size()) == N-1);
	for (int v : vals) { cout << v << ' '; }
	cout << '\n';
 
	return 0;
}