#include <bits/stdc++.h>
using namespace std;
long long int mod(long long int x) { return x % 1000000007; }
long long int power(long long int x, long long int y, long long int p) {
  long long int res = 1;
  x = x % p;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
long long int mod(long long int num, long long int den) {
  return mod(mod(num) * power(den, 1000000007 - 2, 1000000007));
}
vector<long long int> primes() {
  long long int n = 5e+5;
  vector<long long int> ans(n + 1);
  for (long long int i = 1; i <= n; ++i) ans[i] = i;
  for (long long int i = 2; i * i <= n; ++i) {
    if (ans[i] == i) {
      for (long long int j = i * i; j <= n; j += i)
        if (ans[j] == j) ans[j] = i;
    }
  }
  return ans;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long int n;
  cin >> n;
  vector<long long int> pr = primes();
  priority_queue<long long int> pq;
  for (long long int i = 2; i <= n; ++i) {
    pq.push(i / pr[i]);
    if (pq.size() > (n - 1)) pq.pop();
  }
  vector<long long int> ans;
  while (!pq.empty()) {
    ans.push_back(pq.top());
    pq.pop();
  }
  reverse(ans.begin(), ans.end());
  for (int i = 0; i < ans.size(); ++i) {
    cout << ans[i] << " ";
  }
  cout << endl;
  ;
}
