#include "bits/stdc++.h"
// #include "grader.cpp"
#include "migrations.h"
using namespace std;
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define tr(i, c) for(auto i = c.begin(); i != c.end(); ++i)
#define wr puts("----------------")
#define mm make_pair
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
const int N = 10000;
int d[N], mx;
int send_message(int n, int x, int pr){
d[x]=d[pr]+1;
if(x+14==n)
mx=max_element(d, d+n)-d;
if(x+14>=n){
if(d[x]>d[mx]){
mx=x;
return 2;
}
if((mx&(1<<(n-x-1)))!=0)
return 1;
else
return 0;
}
return 0;
}
pii longest_path(vector<int> S){
int n=(int)S.size();
int ret=0;
for(int i = 0; i < 14; ++i){
if(S.back()==2)
return {0, n-i-1};
if(S[i]==1)
ret+=(1<<(n-i-1));
S.pop_back();
}
pii answer=mm(0, ret);
return answer;
}
