#include <bits/stdc++.h>
using namespace std;
vector<vector<int> > g;
vector<int> d;
int c = 0;

void bfs(int start){
    queue<int> q;
    q.push(start);
    d[start] = 1;
    int v;
    while (!q.empty()){
        v = q.front();
        q.pop();
        if (!c && !g[v].size()){
            c = d[v];
        }
        for (int x : g[v]){
            d[x] = d[v] + 1;
            q.push(x);
        }
    }
}

int main() {
    int n, a;
    cin >> n;
    g.resize(n+1);
    d.assign(n+1, -1);
    for (int i=2; i<n+1; i++){
        cin >> a;
        g[a].push_back(i);
    }
    bfs(1);
    cout << c << "\n";
    for (int i=1; i<n+1; i++){
        cout << min(d[i], c) << " ";
    }
}