#include <iostream>

#include <limits.h>
#include <bits/stdc++.h>

using namespace std;


int n;
    bool ciur[100001];

int sol;
int prime[100001];

int main() {
    cin >> n;
    ciur[0] = ciur[1] = true;
    for (int j = 4; j <= n; j += 2)
        ciur[j] = true;
    for (int i = 3; i * i <= n; i += 2)
        if (!ciur[i])
            for (int j = i * i; j <= n; j += 2 * i)
                ciur[j] = true;

    prime[sol++] = 2;
    for (int i = 3; i <= n; i += 2)
        if (!ciur[i])
            prime[sol++] = i;

    cout << sol << '\n';
    for (int i = 0; i < sol; i++)
        cout << ciur[i] << ' ';
    cout << '\n';
    return 0;
}