#include <bits/stdc++.h>
#include "secret.h"
using namespace std;
const int mxN = 1005;
int a[mxN], dp[mxN][mxN], n;
void process(int l, int r){
if(l > r) return;
if(l == r){
dp[l][r] = a[l];
return;
}
int mid = (l + r) / 2;
dp[mid][mid] = a[l], dp[mid + 1][mid + 1] = a[mid + 1];
for(int i = mid - 1; i >= l; --i){
dp[i][mid] = Secret(dp[i + 1][mid], a[i]);
}
for(int i = mid + 1; i <= r; ++i){
dp[mid][i] = Secret(dp[mid][i - 1], a[i]);
}
process(l, mid), process(mid + 1, r);
}
int get(int start, int end, int l, int r){
if(l == r) return a[l];
int mid = (start + end) / 2;
if(l <= mid && mid <= r){
if(mid == r) return dp[l][mid];
return Secret(dp[l][mid], dp[mid + 1][r]);
} else if(mid < l){
return get(mid + 1, end, l, r);
} else{
return get(start, mid, l, r);
}
}
void Init(int N, int A[]) {
n = N;
for(int i = 0; i < N; ++i) a[i] = A[i];
process(0, n - 1);
}
int Query(int L, int R) {
return get(0, n - 1, L, R);
}
