#include <bits/stdc++.h>

using namespace std;
using ll = long long int;
const ll inf = 1e9;

const ll mod = 20210108;

vector<int> g[200100];

int dfs(int node){
  if(g[node].size() == 0) return 1;
  int min_d = numeric_limits<int>::max();
  for(auto i : g[node]){
    min_d = min(dfs(i), min_d);
  }
  return min_d + 1;
}

int sol[200100];

void color(int node, int min_d, int level = 0){
  sol[node] = level % min_d + 1;
  for(auto i : g[node]){
    color(i, min_d, level + 1);
  }
}

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