#include "secret.h"
#define mid(l, u) ((l+u)/2)
#define lchild(i) (i*2 + 1)
#define rchild(i) (i*2 + 2)
using namespace std;
int DP[1000][1000];
int segtree[4000];
int n;
int build(int l, int u, int i, int a[]){
if(l==u) return DP[l][u] = segtree[i] = a[l];
return DP[l][u] = segtree[i] = Secret(build(l, mid(l, u), lchild(i), a), build(mid(l, u)+1, u, rchild(i), a));
}
int query(int l, int u, int i, int ll, int uu){
if(DP[ll][uu]>-1) return DP[ll][uu];
if(l>=ll && u<=uu) return segtree[i];
if(ll>mid(l, u)) return query(mid(l, u)+1, u, rchild(i), ll, uu);
if(uu<=mid(l, u)) return query(l, mid(l, u), lchild(i), ll, uu);
return DP[ll][uu] = Secret(query(l, mid(l, u), lchild(i), ll, mid(l, u)), query(mid(l, u)+1, u, rchild(i), mid(l, u)+1, uu));
}
void Init(int N, int A[]){
n = N;
for(int i = 0;i<n;i++){
for(int j = 0;j<n;j++) DP[i][j] = -1;
}
build(0, n-1, 0, A);
for(int i = 0;i<n;i++){
for(int j = i;j<n;j++){
query(0, n-1, 0, i, j);
}
}
}
int Query(int L, int R){
return query(0, n-1, 0, L, R);
}
