#include "secret.h"
const int MAXN = 1e3+1;
int SRQ[MAXN][MAXN];
int Arrl[MAXN];
int globul;
//int Secret(int X, int Y);
void initTree(int l, int r){
int mid = (l+r)>>1;
SRQ[mid][mid] = Arrl[mid];
SRQ[mid+1][mid+1] = Arrl[mid+1];
for (int i = mid-1; i >= l; i--){
SRQ[mid][i] = Secret(Arrl[i], SRQ[mid][i+1]);
}
for (int i = mid+2; i <= r; i++){
SRQ[mid+1][i] = Secret(Arrl[i], SRQ[mid+1][i-1]);
}
if (l < mid)initTree(l, mid);
if (r > mid+1)initTree(mid+1, r);
}
int followInit(int wL, int wR){
int a = 0, b = globul-1;
while (a < b){
if (a == b)return SRQ[a][b];
int mid = (a+b)>>1;
if (mid >= wL && mid < wR)return Secret(SRQ[mid][wL], SRQ[mid+1][wR]);
if (mid == wR)return SRQ[mid][wL];
if (mid >= wL){
b = mid;
} else {
a = mid+1;
}
}
return -1;
}
void Init(int N, int A[]){
for (int i = 0; i < N; i++){
Arrl[i] = A[i];
}
globul = N;
initTree(0, N-1);
}
int Query(int L, int R){
return followInit(L, R);
}
