#include <bits/stdc++.h>

using namespace std;

const int MAXN = 5000;

int a[MAXN + 1], b[MAXN + 1], c[MAXN + 1];

int sol[MAXN + 1];

int ans = 0;

int n;

inline int get(int cnt) {
    int i = 1;
    while(cnt > 0) {
        if(sol[i] == 0)
            cnt--;
        i++;
    }
    return i - 1;
}

void solve(int l, int r, int lvl) {
    int len = r - l + 1;
    if(l > r)
        return ;
    ans = max(ans, lvl);
    if(l == r) {
        sol[get(1)] = l;
    }
    else if(a[len] == b[len]) {
        sol[get(a[len])] = l;
        solve(l + 1, r, lvl + 1);
    }
    else if(b[len] == c[len]) {
        sol[get(b[len])] = l;
        solve(l + 1, r, lvl + 1);
    }
    else {
        sol[get(c[len])] = l + 1;
        sol[get(b[len])] = l;
        //solve(l, l, lvl + 1);
        ans = max(ans, lvl + 1);
        solve(l + 2, r, lvl + 1);
    }
}

int main() {
    ifstream cin("sortare.in");
    ofstream cout("sortare.out");
    int i, n;
    ios::sync_with_stdio(false);
    cin >> n;
    for(i = 2; i <= n; i++) {
        cin >> a[i] >> b[i] >> c[i];
        if(a[i] > c[i])
            swap(a[i], c[i]);
        if(b[i] > c[i])
            swap(b[i], c[i]);
        if(a[i] > b[i])
            swap(a[i], b[i]);
    }
    solve(1, n, 1);
    cout << ans << endl;
    for(i = 1; i <= n; i++) {
        cout << sol[i] << " ";
    }
    cin.close();
    cout.close();
    return 0;
}