#include <iostream>
#include <vector>
#include <climits>
using namespace std;
int szincnt=INT_MAX;
vector<vector<int>> adj;
vector<int> child;
vector<int> ancestor;
vector<int> color;
void dfs(int s,int p)
{
ancestor[s]=ancestor[p]+1;
for(auto x:adj[s])
    {
    dfs(x,s);
    child[s]+=child[x]+1;
    }
szincnt=min(szincnt,child[s]+ancestor[s]);
//cout<<szincnt<<" "<<s<<"\n";
}
void dfs2(int s,int p)
{
if(color[p]+1<=szincnt)
    {
    color[s]=color[p]+1;
    }
else color[s]=1;
for(auto x:adj[s])dfs2(x,s);
}

int main()
{
    int n;
    cin>>n;
    int x;
    adj.resize(n+1);
    child.resize(n+1,0);
    ancestor.resize(n+1,0);
    color.resize(n+1,0);
    for(int i=1;i<n;i++)
        {
        cin>>x;
        adj[x].push_back(i+1);
        }
    dfs(1,1);
    cout<<szincnt<<"\n";
    dfs2(1,1);
    for(int i=1;i<=n;i++)cout<<color[i]<<" ";
    return 0;
}