#include "migrations.h"
#include<bits/stdc++.h>
using namespace std;
int val[10000], mx, ind;
int send_message(int N, int i, int Pi) {
val[i] = val[Pi]+1;
mx = max(val[i], mx);
if(mx ==val[i]) ind = i;
if(i>N-8&&mx == val[i]) return 4;
if(i>N-8) {
int k = ind%4;
ind/=4;
return k;
}
return 0;
}
pair<int, int> longest_path(vector<int> S) {
int N = 10000;
pair<int, int> p;
p.first = 0;
p.second = 0;
for(int i =N-7; i<N; i++) {
if(S[i]==4) {
p.second = i;
}
}
if(p.second!=0) return p;
int k = 1;
for(int i =N-7; i < N; i++) {
p.second += k*S[i];
k*=4;
}
return p;
}
