#include <bits/stdc++.h>
#include "popa.h"
using namespace std;
vector<int> parent;
vector<bool> seen;
int cntr;
void calc(int v, int p, int N) {
while (v != p) {
cntr = max(cntr, v);
if (query(v, v + 1, v + 1, v + 1))
parent[v] = v + 1;
else {
calc(v + 1, v, N);
if (cntr + 1 == N || query(v, cntr + 1, p, cntr + 1))
parent[v] = p;
else
parent[v] = cntr + 1;
}
v = parent[v];
}
}
int solve(int N, int* L, int* R) {
cntr = 0;
parent.assign(N, -1);
seen.assign(N, false);
seen[0] = seen[1] = true;
calc(0, -1, N);
for (int i = 0; i < N; i++)
L[i] = R[i] = -1;
int r = -1;
for (int i = 0; i < N; i++) {
if (parent[i] == -1)
r = i;
else {
if (i < parent[i])
L[parent[i]] = i;
else
R[parent[i]] = i;
}
}
return r;
}
