#include <bits/stdc++.h>
using namespace std;
vector<int> build(int n) {
  map<int, bool> s;
  for (int i = 2; i * i <= n; i++) {
    if (s[i] == false) {
      for (int j = 2 * i; j <= n; j = j + i) s[j] = true;
    }
  }
  vector<int> t;
  for (int i = 2; i <= n; i++) {
    if (s[i] == false) t.push_back(i);
  }
  return t;
}
int main() {
  int n;
  cin >> n;
  vector<int> a = build(n);
  int b[n - 1];
  int s = 1;
  for (int i = 0; i < a.size(); i++) {
    for (int j = a[i]; j <= n; j = j + a[i]) b[j - 2] = s;
    s++;
  }
  for (int i = 0; i < n - 1; i++) cout << b[i] << " ";
  return 0;
}
