// Problem: C. Ehab and a Special Coloring Problem
// Contest: Codeforces - Codeforces Round #563 (Div. 2)
// URL: https://codeforces.com/problemset/problem/1174/C
// Memory Limit: 256 MB
// Time Limit: 1000 ms
// 2022-03-04 12:19:14
//
// Powered by CP Editor (https://cpeditor.org)
#include<bits/stdc++.h>
using namespace std;
#define rep(i,l,r) for(int i=(l);i<=(r);i++)
#define per(i,l,r) for(int i=(l);i>=(r);i--)
#define ll long long
#define pii pair<int, int>
#define mset(s,t) memset(s,t,sizeof(t))
#define mcpy(s,t) memcpy(s,t,sizeof(t))
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define mp make_pair
const ll mod = 1e9 + 7;
inline ll qmi (ll a, ll b) {
ll ans = 1;
while (b) {
if (b & 1) ans = ans * a%mod;
a = a * a %mod;
b >>= 1;
}
return ans;
}
inline int read () {
int x = 0, f = 0;
char ch = getchar();
while (!isdigit(ch)) f |= (ch=='-'),ch= getchar();
while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
return f?-x:x;
}
template<typename T> void print(T x) {
if (x < 0) putchar('-'), x = -x;
if (x >= 10) print(x/10);
putchar(x % 10 + '0');
}
inline ll sub (ll a, ll b) {
return ((a - b ) %mod + mod) %mod;
}
inline ll add (ll a, ll b) {
return (a + b) %mod;
}
inline ll inv (ll a) {
return qmi(a, mod - 2);
}
int a[100005];
int n;
bool check (int tar) {
for (int i = 2; i <= tar / i; i ++)
if (tar % i == 0) return 0;
return 1;
}
void solve() {
cin >> n;
for (int i = 2; i<= n; i += 2)
a[i] = 1;
a[3] = 2;
int maxv = 2;
for (int i = 5; i <= n; i += 2) {
if (check(i)) {
a[i] = (++maxv);
}
else {
for (int j = 2; j<= i / j; j ++) {
if (i % j == 0) {
a[i] = a[j];
break;
}
}
}
}
for (int i = 2; i <= n ;i ++)
cout << a[i] << " ";
puts("");
}
int main () {
int t;
t =1;
//cin >> t;
while (t --) solve();
return 0;
}
通过从下标开始想。构造一个可行解。所有偶数都为1,奇数分解质因数,只有素数会对最大值有贡献