#include<bits/stdc++.h>
#include "popa.h"
using namespace std;
int solve (int l, int r, int *Left, int *Right)
{
if (l > r) return -1;
if (l == r)
return l;
if (r == l + 1)
{
if (query (l, l, l, r))
{
Right[l] = r;
return l;
}
Left[r] = l;
return r;
}
int ras = (l + r) / 2;
for (int i=1; l + i - 1 <= r - i + 1; i++)
{
if (query (l, l + i - 1, l, r))
{
ras = l + i - 1;
break;
}
if (query (r - i + 1, r, l, r))
{
ras = r - i + 1;
break;
}
}
Left[ras] = solve (l, ras - 1, Left, Right);
Right[ras] = solve (ras + 1, r, Left, Right);
return ras;
}
int solve (int nn, int* Left, int* Right)
{
int N = nn;
for (int i=0; i<N; i++)
Left[i] = Right[i] = -1;
int root = solve (0, N - 1, Left, Right);
return root;
}
