#include <bits/stdc++.h>
#include "secret.h"
#define vi vector<int>
#define ve vector
#define ll long long
#define vf vector<float>
#define vll vector<pair<ll,ll>>
#define ii pair<int,int>
#define vvi vector<vi>
#define vii vector<ii>
#define gii greater<ii>
#define pb push_back
#define fi first
#define se second
#define INF 1e9
#define eps 1e-7
#define eps1 1e-25
#define optimise ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define MAX_A 1e5+5
#define V 450
using namespace std;
const int MOD = 1e9+7;
const int nax = 1005;
int n;
vi s;
int t[nax][nax];
void solve(int l, int r){
int md = (l+r)/2;
t[md][md] = s[md];
t[md+1][md+1] = s[md+1];
//cout << l << " " << r << endl;
for (int i = md+2; i <= r; ++i)
{
t[md+1][i] = Secret(t[md+1][i-1],s[i]);
//cout << i << endl;
}
for (int i = md-1; i >= l; --i)
{
t[md][i] = Secret(t[md][i+1],s[i]);
//cout << i << endl;
}
if(l < md) solve(l,md);
if(md +1 < r) solve(md+1,r);
}
void Init(int N, int A[]){
n = N;
for (int i = 0; i < N; ++i)
{
s.pb(A[i]);
}
solve(0,n-1);
}
int Query(int L, int R){
int l = 0, r = n-1;
while(l != r){
int md = (l+r)/2;
if(md >= L && md < R)
return Secret(t[md][L], t[md+1][R]);
else if(md == R) return t[md][L];
else if(md > R)
r = md;
else
l = md+1;
}
return t[l][l];
}
