#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main() {
    size_t n;
    cin >> n;
    vector<int> vec(n);
    for (size_t i = 0; i < n; ++i) {
        cin >> vec[i];
    }

    vector<int> ans(n);
    ans[0] = 1;
    for (size_t i = 1; i < n; ++i) {
        if (vec[i] == vec[i - 1]) {
            ans[i] = ans[i - 1];
        } else {
            ans[i] = ans[i - 1] ^ 3;
        }
    }

    while (((vec[n - 1] != vec[n - 2]) && (ans[n - 1] == ans[n - 2]))
          || ((vec[n - 1] != vec[0]) && (ans[n - 1] == ans[0]))) {
        ans[n - 1]++;
    }

    cout << (*max_element(ans.begin(), ans.end())) << endl;
    for (auto e : ans) {
        cout << e << ' ';
    }
    cout << endl;
    return 0;
}