// Source: https://usaco.guide/general/io

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

const int MOD=20210108;

signed main() {
    int n;cin>>n;
    vector<int> p(n),dp(n,-1),vane(n);
    vector<vector<int>> v(n);
    dp[0]=1;
    for(int i = 1;i<n;i++){
        cin>>p[i];
        p[i]--;
        vane[p[i]]=1;
        v[p[i]].push_back(i);
    }
    queue<int> q;
    q.push(0);
    while(!q.empty()){
        int a=q.front();
        q.pop();
        for(int u : v[a]){
            if(dp[u]==-1){
                dp[u]=dp[a]+1;
                q.push(u);
            }
        }
    }
    int k=n;
    for(int i = 0;i<n;i++){
        if(!vane[i]){
            k=min(k,dp[i]);
        }
    }
    cout<<k<<endl;
    for(int i : dp)cout<<i%k+1<<' ';
}