#include <bits/stdc++.h>
using namespace std;
inline long long mod(long long n, long long m) {
  long long ret = n % m;
  if (ret < 0) ret += m;
  return ret;
}
long long gcd(long long a, long long b) { return (b == 0 ? a : gcd(b, a % b)); }
long long exp(long long a, long long b, long long m) {
  if (b == 0) return 1;
  if (b == 1) return mod(a, m);
  long long k = mod(exp(a, b / 2, m), m);
  if (b & 1) {
    return mod(a * mod(k * k, m), m);
  } else
    return mod(k * k, m);
}
const long long MAXN = 500100;
long long dp[MAXN];
long long big[MAXN];
long long a[MAXN];
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  long long n;
  cin >> n;
  for (long long i = 1; i <= n; i++) big[i] = 1;
  for (long long i = 1; i <= n; i++) {
    for (long long j = i; j <= n; j += i) {
      if (j != i) big[j] = max(big[j], i);
    }
  }
  vector<long long> v;
  for (long long i = 1; i <= n; i++) {
    v.push_back(i);
  }
  sort(v.begin(), v.end(),
       [&](long long a, long long b) { return big[a] < big[b]; });
  for (long long i = 1; i <= n; i++) {
    a[i] = v[i - 1];
  }
  dp[1] = 1;
  for (long long i = 2; i <= n; i++) {
    dp[i] = dp[i - 1];
    dp[i] = max(dp[i], big[a[i]]);
  }
  for (long long i = 2; i <= n; i++) {
    cout << dp[i] << " ";
  }
  cout << "\n";
}
