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

int n,m;
int col[200001];
vector<int> g[200001];

int dfs(int x,int depth)
{
    col[x]=depth;
    if(g[x].empty()) return 1;
    int res=n+1;
    for(auto s:g[x]) res=min(res,dfs(s,depth+1)+1);
    return res;
}

int main () {
    cin>>n;
    for(int i=2;i<=n;i++)
    {
        int x;
        cin>>x;
        g[x].push_back(i);
    }
    int min_depth=dfs(1,1);
    cout<<min_depth<<endl;
    for(int i=1;i<=n;i++) cout<<((col[i]<=min_depth) ? col[i] : 1)<<" ";
    cout<<endl;
    return 0;
}