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

#define ll long long
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define fi first
#define se second

const int maxn = 2e5;

int n;
vector<int> g[maxn + 1];
int dep[maxn + 1];

void dfs(int x) {
    for(int y : g[x]) {
        dep[y] = dep[x] + 1;
        dfs(y);
    }
}

void solve() {
    cin >> n;
    for(int i = 2; i <= n; i++) {
        int p;
        cin >> p;
        g[p].pb(i);
    }
    dep[1] = 1;
    dfs(1);
    int ans = maxn + 1;
    for(int i = 1; i <= n; i++) {
        if(g[i].size() == 0) {
            ans = min(ans, dep[i]);
        }
    }
    cout << ans << "\n";
    for(int i = 1; i <= n; i++) {
        cout << min(ans, dep[i]) << " ";
    }
    cout << "\n";
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
    return 0;
}