#include <bits/stdc++.h>
const int maxn = 100005;
int n, cnt;
int a[maxn], p[maxn];
int main() {
  scanf("%d", &n);
  p[1] = 1;
  for (int i = 2; i <= n; i++)
    if (p[i] == 0) {
      p[i] = ++cnt;
      for (int j = i; j <= n; j += i) a[j] = cnt, p[j] = 1;
    }
  for (int i = 2; i <= n; i++) printf("%d%c", a[i], i == n ? '\n' : ' ');
  return 0;
}
