#include <bits/stdc++.h>
#include "secret.h"
#define mid (l+r)/2
using namespace std;
int n, i, a[1010], d[1010][1010];
void init(int l, int r) {
if(l >= r) return;
for(int i = mid+1; i <= r; i++) d[mid][i] = Secret(d[mid][i-1], a[i]);
for(int i = mid-2; i >= l; i--) d[i][mid-1] = Secret(a[i], d[i+1][mid-1]);
init(l, mid-1);init(mid+1, r);
}
void Init(int N, int A[]) {
for(i = 1, n = N; i <= n; i++) a[i] = A[i-1], d[i][i] = a[i];
init(1, N);
}
int query(int l, int r, int L, int R) {
if(L < mid && mid <= R) return Secret(d[L][mid-1],d[mid][R]);
if(L == mid) return d[mid][R];
if(mid < L) return query(mid+1, r, L, R);
return query(l, mid-1, L, R);
}
int Query(int L, int R) {
L++;R++;if(L == R) return a[L];
return query(1, n, L, R);
}
