#include <algorithm>
#include <fstream>
#include <vector>

using namespace std;

int N, Depth;
vector<int> A, B, C, P;

void Solve() {
    P = vector<int>(N, -1);
    vector<int> positions = vector<int>(N);
    for (int i = 0; i < N; ++i)
        positions[i] = i;
    while (int(positions.size()) >= 2) {
        ++Depth;
        int n = int(positions.size());
        int p[3] = {A[n], B[n], C[n]};
        sort(p, p + 3);
        if (p[0] == p[1] || p[1] == p[2]) {
            P[positions[p[1]]] = N - n + 1;
        } else {
            P[positions[p[0]]] = N - n + 1;
            P[positions[p[1]]] = N - n + 2;
        }
        vector<int> newPositions = vector<int>();
        for (int i = 0; i < n; ++i)
            if (P[positions[i]] == -1)
                newPositions.push_back(positions[i]);
        positions = newPositions;
    }
    if (int(positions.size()) == 1) {
        ++Depth;
        P[positions[0]] = N;
    }
}

void Read() {
    ifstream cin("sortare.in");
    cin >> N;
    A = B = C = vector<int>(N + 1, 0);
    for (int i = 2; i <= N; ++i) {
        cin >> A[i] >> B[i] >> C[i];
        --A[i];
        --B[i];
        --C[i];
    }
    cin.close();
}

void Print() {
    ofstream cout("sortare.out");
    cout << Depth << "\n";
    for (int i = 0; i < N; ++i)
        cout << P[i] << " ";
    cout << "\n";
    cout.close();
}

int main() {
    Read();
    Solve();
    Print();
    return 0;
}