#include <bits/stdc++.h>

using namespace std;

vector<vector<int>> g;
vector<int> s;
int ans = INT_MAX;


void dfs(int u, int p, int depth) {
    s[u] = depth;
    if (!g[u].size()) ans = min(ans, depth);
    for (int v : g[u]) {
        if (v != p)
            dfs(v, u, depth+1);
    }
}

int main() {
    int n;
    cin >> n;
    g.resize(n+1);
    s.resize(n+1);
    for (int i=2;i<=n;i++) {
        int a;
        cin >> a;
        g[a].push_back(i);
    }

    dfs(1, 1, 1);
    cout << ans << endl;
    for (int i=1;i<=n;i++) {
        cout << min(ans, s[i]) << " ";
    }
    cout << endl;
    return 0;
}