#include <bits/stdc++.h>
using namespace std;
#define f(i,k,n) for(int i=k; i<n; i++)
#define ll long long
const int inf = INT_MAX;

void solve()
{
    int n;
    cin>>n;
    vector<vector<int>> g(n);
    int x;
    f(i,1,n)
    {
        cin>>x;
        g[i].push_back(x-1);
        g[x-1].push_back(i);
    }
    int mini=inf;
    int pozi=-1;
    set<int> s;
    f(i,0,n)
    {
        if(mini>g[i].size())
        {
            mini=g[i].size();
            pozi=i;
            s.insert(i);
        }
    }
    mini++;
    cout<<mini<<"\n";
    vector<int> v(n,1);
    for(auto x:g[pozi])
    {
        v[x]=mini;
        mini--;
    }
    f(i,0,n)    cout<<v[i]<<" ";
    cout<<"\n";
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t=1;
    //cin>>t;
    while(t--)  solve();
    return 0;
}