#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
bool prime[500001];
long long d[500001];
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  long long n;
  cin >> n;
  fill(prime, prime + n + 1, true);
  prime[0] = prime[1] = false;
  d[1] = 1;
  for (long long i = 2; i <= n; i++)
    if (prime[i]) {
      d[i] = i;
      for (long long j = i * i; j <= n; j += i) {
        if (prime[j]) d[j] = i;
        prime[j] = false;
      }
    }
  vector<long long> nums(n);
  for (long long i = 0; i < n; i++) nums[i] = i + 1;
  sort(nums.begin(), nums.end(),
       [](long long a, long long b) { return a / d[a] < b / d[b]; });
  for (long long i = 1; i < n; i++) cout << nums[i] / d[nums[i]] << ' ';
  return 0;
}
