#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const long long MAXN = 2e5 + 5;
const long long INF = 1e18;
const long double PI = acos((long double)-1);
vector<pair<long long, long long> > primefact(long long n) {
  vector<pair<long long, long long> > primes;
  long long cnt = 0;
  while (n % 2 == 0) {
    cnt++;
    n >>= 1;
  }
  if (cnt) primes.emplace_back(2, cnt);
  for (int i = 3; i <= sqrt(n); i += 2) {
    cnt = 0;
    while (n % i == 0) {
      n /= i;
      cnt++;
    }
    if (cnt) primes.emplace_back(i, cnt);
  }
  if (n > 1) primes.emplace_back(n, 1);
  return primes;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  vector<pair<long long, long long> > composites;
  long long primecnt = 0;
  long long n;
  cin >> n;
  vector<vector<pair<long long, long long> > > factors;
  factors.push_back(vector<pair<long long, long long> >());
  factors.push_back(vector<pair<long long, long long> >());
  for (int i = (2); i <= (n); i++) {
    factors.push_back(primefact(i));
    if (factors[i].size() == 1 && factors[i][0].second == 1)
      primecnt++;
    else
      composites.emplace_back(i / factors[i][0].first, i);
  }
  sort(composites.begin(), composites.end());
  for (int i = (1); i <= (primecnt); i++) cout << "1 ";
  long long sz = (long long)composites.size() - 1;
  for (int i = (0); i <= (sz); i++) cout << composites[i].first << " ";
}
