#include <bits/stdc++.h>   using namespace std;   using ll = long long;   const int MAX_N = 1e5 + 9;   int ans[MAX_N];   void sieve(int n) {     int nw = 1;     for (int i = 2; i <= n; i++) ans[i] = INT_MAX;     for (ll i = 2; i <= n; i++) {       if (ans[i] != INT_MAX) continue;       for (ll j = i; j <= n; j += i) ans[j] = min(ans[j], nw);       nw++;     }   }   int main() {     int n;     cin >> n;     sieve(n);     for (int i = 2; i <= n; i++) cout << ans[i] <<    ;   }   