#include <bits/stdc++.h>

using namespace std;

int dist(int p, vector<int>& memo, const vector<int>& parent)
{
    if (memo[p] != -1)
    {
        return memo[p];
    }
    return memo[p] = dist(parent[p], memo, parent) + 1;
}

int main()
{
    int N;
    cin >> N;
    vector<int> parent(N);
    vector<bool> is_leaf(N);
    fill(is_leaf.begin(), is_leaf.end(), true);
    for (int i = 1; i < N; ++i)
    {
        int p;
        cin >> p;
        parent[i] = p - 1;
        is_leaf[p - 1] = false;
    }
    vector<int> memo(N);
    fill(memo.begin(), memo.end(), -1);
    memo[0] = 0;

    int min_dist = N;
    for (int i = 0; i < N; ++i)
    {
        int d = dist(i, memo, parent);
        if (is_leaf[i] && d < min_dist)
        {
            min_dist = d;
        }
    }

    cout << min_dist + 1 << '\n';
    for (int i = 0; i < N; ++i)
    {
        cout << dist(i, memo, parent) % (min_dist + 1) + 1 << " ";
    }

    return 0;
}