#include <iostream>
#include <vector>
#include <deque>

#define ll long long 

using namespace std;

ll n,i,a,mini=9999999;
struct element
{
    ll step,father;
    vector <ll> sz;
    bool leaf=false;
    ll color;
};
vector <element> x;

void BFS (ll start)
{
    deque<ll> v;
    v.push_back(start);
    x[start].step=1;
    ll curr;
    while (!v.empty())
    {
        curr=v[0];
        v.pop_front();
        if (x[curr].sz.empty())
        {
            x[curr].leaf=true;
            if (x[curr].step<mini) mini=x[curr].step;
            return;
        }
        for (auto &e:x[curr].sz)
        {
            x[e].step=x[curr].step+1;
            v.push_back(e);
        }
    }
}

void paint(ll curr)
{
    ll one=1;
    x[curr].color=max(one,x[x[curr].father].color-1);
    for (auto &e:x[curr].sz) paint(e);
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);

    cin>>n;
    x.resize(n+1);

    for (i=2;i<=n;++i)
    {
        cin>>a;
        x[a].sz.push_back(i);
        x[i].father=a;
    }
    BFS(1);
    x[0].color=mini+1;
    cout<<mini<<"\n";
    paint(1);
    for (i=1;i<=n;++i) cout<<x[i].color<<" ";
}