#include <bits/stdc++.h>
using namespace std;
vector<int> g[200001];
vector<int> tav;
vector<bool> vangyereke;
int bfsminmely(){
    queue<int> q;
    int mntav=20000001;
    tav[1]=1;
    q.push(1);
    while (!q.empty()){
        int v=q.front();
        q.pop();
        for (int edge:g[v]){
            tav[edge]=tav[v]+1;
            q.push(edge);
        }
        if(!vangyereke[v]) mntav=min(mntav,tav[v]);
    }
    return mntav;
}
vector<int> color;
void dfs(int x,int clm){
    color[x]=clm;
    if (clm>1) clm--;
    for (int edge:g[x]) dfs(edge,clm);
}
int main()
{
    int n;
    cin>>n;
    tav.resize(n+1,0);
    color.resize(n+1,-1);
    vangyereke.resize(n+1,false);
    for (int i=2; i<=n;i++){
        int p;
        cin>>p;
        g[p].push_back(i);
        vangyereke[p]=true;
    }
    int colordb=bfsminmely();
    cout<<colordb<<endl;
    dfs(1,colordb);
    for (int i=1; i<=n;i++) cout<<color[i]<<" ";
}