#include "secret.h"
#include <algorithm>
using namespace std;
int t[10][1005];
int *pt;
void make(int depth, int A[], int N, int piv){
if(depth == -1) return;
make(depth-1,A,N,piv - (1<<(depth-1)));
make(depth-1,A,N,piv + (1<<(depth-1)));
if(N <= piv) return;
t[depth][piv-1] = A[piv-1];
t[depth][piv] = A[piv];
for (int i=piv-2; i>=piv - (1<<depth); i--) {
t[depth][i] = Secret(A[i],t[depth][i+1]);
}
for (int i=piv+1; i<piv + (1<<depth) && i < N; i++) {
t[depth][i] = Secret(t[depth][i-1],A[i]);
}
}
void Init(int N, int A[]){
pt = A;
make(9,A,N,512);
}
int q(int p, int l, int r, int d){
if(d == 0) return pt[p];
if(l <= p-1 && p <= r) return Secret(t[d][l],t[d][r]);
if(r <= p-1) return q(p-(1<<(d-1)),l,r,d-1);
return q(p+(1<<(d-1)),l,r,d-1);
}
int Query(int L, int R){
return q(512,L,R,9);
}
