#include "bits/stdc++.h"
#include "secret.h"
using namespace std;
#ifndef EVAL
#include "grader.cpp"
#endif
const int M = 1005;
int a[M], NN;
int ask(int a, int b){
if(a == -1) return b;
if(b == -1) return a;
return Secret(a, b);
}
struct ST{
int pref[M<<2][M], suff[M<<2][M];
void build(int lx = 0, int rx = M, int x = 1){
if(lx == rx) { pref[x][0] = a[lx]; return; }
int m = (lx + rx) >> 1;
pref[x][0] = a[m];
for(int i=1;m-i>=lx;i++){
pref[x][i] = ask(pref[x][i-1], a[m-i]);
}
suff[x][0] = a[m+1];
for(int i=1;m+1+i<=rx;i++){
suff[x][i] = ask(suff[x][i-1], a[m+1+i]);
}
build(lx, m, x<<1);
build(m+1, rx, x<<1|1);
}
int get(int l, int r, int lx = 0, int rx = M, int x = 1){
if(lx == rx) return a[lx];
int m = (lx + rx) >> 1;
if(r <= m) return get(l, r, lx, m, x<<1);
if(m < l) return get(l, r, m+1, rx, x<<1|1);
return ask(pref[x][m-l], suff[x][r-m-1]);
}
}tree;
void Init(int N, int A[]) {
NN = N;
for(int i=0;i<N;i++){
a[i] = A[i];
}
tree.build(0, NN - 1, 1);
}
int Query(int L, int R) {
return tree.get(L, R, 0, NN - 1, 1);
}
