sherlock

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
typedef tree<ll,null_type,less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update>ordered_set;
#define suni ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define endl "\n"
#define mn int main()
#define frac() cout.unsetf(ios::floatfield);cout.precision(6);cout.setf(ios::fixed,ios::floatfield);


const int mx=1e5+123;
bitset<mx>isprime;
vector<int>prime(mx);
void primegen(int n)
{
    n+=100;
    for(int i=3;i<=n;i+=2) isprime[i]=1;
    for(int i=3;i*i<=n;i+=2){
            if(isprime[i]){
        for(int j=i*i;j<=n;j+=(i*2))
            isprime[j]=0;
      }
    } //O(n)
    isprime[2]=1;
    for(int i=1;i<=n;i++){
        if(isprime[i+1]) prime[i+1]=1;
        else  prime[i+1]=2;
    }
}
mn
{
    int n;
    cin>>n;
    primegen(n);
    if(n<3) cout<<1<<endl;
    else cout<<2<<endl;
    for(int i=1;i<=n;i++)
        cout<<prime[i+1]<<" ";

}