#include <bits/stdc++.h>

using namespace std;

#define int long long


int n, minmelyseg = LLONG_MAX/2;
vector<int> parent, melyseg;
vector<vector<int> > g;

void dfs(int v, int s) {
    melyseg[v] = s;
    if (g[v].size() == 0) {
        if (s < minmelyseg) {
            minmelyseg = s;
        }
    }
    for (int u : g[v]) {
        dfs(u, s + 1);
    }
}

main() {
    cin >> n;
    parent.resize(n + 1, 0);
    g.resize(n + 1);
    melyseg.resize(n + 1);

    for (int i = 2; i <= n; i++) {
        cin >> parent[i];
        g[parent[i]].push_back(i);
    }

    dfs(1, 1);

    cout << minmelyseg << endl;

    for (int i = 1; i <= n; i++) {
        cout << (melyseg[i] <= minmelyseg ? melyseg[i] : 1) << " ";
    }
    cout << endl;
}