#include <bits/stdc++.h>
using namespace std;
long long mod = 1e9 + 7;
long long max(long long a, long long b) {
  if (a > b)
    return a;
  else
    return b;
}
long long min(long long a, long long b) {
  if (a < b)
    return a;
  else
    return b;
}
long long gcd(long long a, long long b, long long& x, long long& y) {
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  }
  long long x1, y1;
  long long d = gcd(b, a % b, x1, y1);
  x = y1;
  y = x1 - y1 * (a / b);
  return d;
}
long long inv(long long a) {
  long long x, y;
  long long g = gcd(a, mod, x, y);
  x = (x % mod + mod) % mod;
  return x;
}
long long binpow(long long a, long long b, long long m) {
  a %= m;
  long long res = 1;
  while (b > 0) {
    if (b & 1) res = res * a % m;
    a = a * a % m;
    b >>= 1;
  }
  return res;
}
long long MAXN = 1e6;
int main() {
  long long ttt;
  ttt = 1;
  while (ttt--) {
    long long n;
    cin >> n;
    vector<int> spf(MAXN + 1);
    spf[1] = 1;
    for (int i = 2; i < MAXN; i++) spf[i] = i;
    for (int i = 4; i < MAXN; i += 2) spf[i] = 2;
    for (int i = 3; i * i < MAXN; i++) {
      if (spf[i] == i) {
        for (int j = i * i; j < MAXN; j += i) {
          if (spf[j] == j) spf[j] = i;
        }
      }
    }
    vector<int> ans;
    for (int i = 2; i <= n; i++) ans.push_back(i / spf[i]);
    sort(ans.begin(), ans.end());
    for (int u : ans) cout << u << " ";
  }
  return 0;
}
