#include <bits/stdc++.h>
#include "secret.h"
#define FIXED_FLOAT(x) std::fixed <<std::setprecision(20) << (x)
#define all(v) (v).begin(), (v).end()
using namespace std;
#define forn(i,n) for (int i = 0; i < (n); ++i)
#define rforn(i, n) for(int i = (n) - 1;i >= 0;--i)
using ll = long long;
int mod = (ll)1e9 + 7;
#define PI acos(-1)
typedef pair<int, int> pairs;
const int INF = 1e9 + 1;
const int N = 1002;
const double eps = 1e-7;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
template <typename XPAX>
void ckma(XPAX &x, XPAX y) {
x = (x < y ? y : x);
}
template <typename XPAX>
void ckmi(XPAX &x, XPAX y) {
x = (x > y ? y : x);
}
int F[N][11];
int mask[N];
V<int> A(N);
int n;
void divi(int l, int r, int lev) {
if(l == r)
return;
int rm = (l + r) / 2;
F[rm][lev] = A[rm];
F[rm + 1][lev] = A[rm + 1];
for(int i = rm - 1;i >= l;--i)
F[i][lev] = Secret(A[i], F[i + 1][lev]);
for(int i = rm + 2;i <= r;++i)
F[i][lev] = Secret(A[i], F[i - 1][lev]);
for(int i = rm + 1;i <= r;++i)
mask[i] ^= 1 << lev;
divi(l, rm, lev + 1);
divi(rm + 1, r, lev + 1);
}
void Init(int D, int s[]) {
forn(i, D) A[i] = s[i];
n = D;
divi(0, n - 1, 0);
}
int Query(int L, int R) {
if(L == R)
return A[L];
int b = __builtin_ctz(mask[L] ^ mask[R]);
return Secret(F[L][b], F[R][b]);
}
