#include <bits/stdc++.h>
using namespace std;

int main() {
    int n, a;
    cin >> n;
    vector<vector<int> > x(n+1);
    vector<int> tav(n+1);
    for (int i=2; i<=n; i++) {
        cin >> a;
        x[a].push_back(i);
    }
    tav[1]=1;
    queue<int> q;
    q.push(1);
    int mi=INT_MAX;
    while (!q.empty()) {
        a=q.front();
        q.pop();
        for (int cs : x[a]) {
            tav[cs]=tav[a]+1;
            q.push(cs);
        }
        if (x[a].size()==0) mi=min(mi, tav[a]);
    }
    cout << mi << "\n";
    for (int i=1; i<=n; i++) cout << min(tav[i], mi) << " ";
    return 0;
}