#include <iostream>
#include <vector>
#define N 200001
using namespace std;
int col[N];
vector<int>child[N];
int p=N;
void bfs(int z)
{
	vector<int>sor;
	sor.push_back(z);
	for(int i=0;i<sor.size();i++)
	{
		int v=sor[i];
		for(int u: child[v])
		{
			if(child[u].size()==0 )
			{
				if(p==N)
				{
					col[u]=col[v]+1;
					p=col[u]+1;
				}
				col[u]=(col[v]+1)%p;
				continue;
			}
			sor.push_back(u);
			col[u]=(col[v]+1)%p;
		}
	}
}
int main()
{
	int n;
	ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	cin>>n;
	col[0]=0;
	for(int i=1;i<n;i++)
	{
		int a;cin>>a;a--;
		child[a].push_back(i);
	}
	bfs(0);
	cout<<p<<endl;
	for(int i=0;i<n;i++)
	{
		cout<<col[i]+1<<" ";
	}
	return 0;
}