#include "migrations.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define sp <<" "<<
#define endl "\n"
vector<int> dep, par;
int send_message(int N, int i, int Pi) {
if (i == 1) {
dep.assign(N, 0);
par.assign(N, 0);
}
par[i] = Pi;
dep[i] = dep[par[i]] + 1;
int res = 0;
if ((i+1) % 200 == 0) {
int best = -1, ind = -1;
for (int j = 0; j < N; j++) {
if (dep[j] > best) {
best = dep[j];
ind = j;
}
}
cerr << best sp ind << endl;
if (i - ind < 200) {
res = i - ind + 1;
}
}
return res;
}
pair<int, int> longest_path(vector<int> S) {
int N = S.size();
int v;
for (int i = N-1; i >= 0; i--) {
if (S[i] != 0) {
int dist = S[i] - 1;
v = i - dist;
break;
}
}
return {0, v};
}
