#include <bits/stdc++.h>
using namespace std;
const int N = 5e5 + 5;
const double eps = 1e-7;
const int mod = 1e9 + 7;
long long gcd(long long a, long long b) { return b > 0 ? gcd(b, a % b) : a; }
long long ksm(long long a, long long b) {
  long long ans = 1;
  while (b) {
    if (b & 1) ans = ans * a % mod;
    a = a * a % mod;
    b >>= 1;
  }
  return ans % mod;
}
int prime[N], is_prime[N];
int tot = 0;
vector<int> v;
unordered_map<int, int> mp;
void sieve(int n) {
  for (int i = 0; i <= n; i++) is_prime[i] = 1;
  is_prime[0] = is_prime[1] = 0;
  for (int i = 2; i <= n; i++) {
    if (is_prime[i]) {
      prime[++tot] = i;
      for (int j = i + i; j <= n; j += i) {
        is_prime[j] = 0;
      }
    }
  }
}
int main() {
  int n;
  cin >> n;
  sieve(n);
  for (int i = 1; i <= tot; i++) {
    cout << 1 << ' ';
  }
  for (int i = 2; i <= n; i++) {
    for (int j = i + i; j <= n; j += i) mp[j] = max(mp[j], i);
  }
  for (int i = 2; i <= n; i++) {
    if (!is_prime[i]) {
      v.push_back(mp[i]);
    }
  }
  sort(v.begin(), v.end());
  for (int i = 0; i < v.size(); i++) cout << v[i] << ' ';
  cout << endl;
  return 0;
}
