#include <bits/stdc++.h>
#include "secret.h"
using namespace std;
#define sz(x) (int)x.size()
#define fi first
#define se second
typedef long long lli;
typedef pair<int, int> pii;
const int maxn = 1005;
int n;
int a[maxn], B[maxn];
vector<int> left_val[maxn * 4], right_val[maxn * 4];
int cnt = 0;
void dnc(int x, int l, int r)
{
if(l == r) return;
int mid = (l + r) / 2;
left_val[x].push_back(a[mid]);
for(int i = mid - 1; i >= l; --i)
left_val[x].push_back(Secret(a[i], left_val[x].back()));
right_val[x].push_back(a[mid + 1]);
for(int i = mid + 2; i <= r; ++i)
right_val[x].push_back(Secret(right_val[x].back(), a[i]));
//cnt += sz(left_val[x]) - 1; cnt += sz(right_val[x]) - 1;
dnc(x * 2, l, mid);
dnc(x * 2 + 1, mid + 1, r);
}
int get(int x, int l, int r, int L, int R)
{
assert(l < r);
int mid = (l + r) / 2;
if(L <= mid && R > mid)
return Secret(left_val[x][mid - L], right_val[x][R - mid - 1]);
if(R <= mid)
return get(x * 2, l, mid, L, R);
return get(x * 2 + 1, mid + 1, r, L, R);
}
void Init(int N, int A[])
{
n = N;
for(int i = 0; i < n; ++i)
a[i] = A[i];
dnc(1, 0, n - 1);
}
int Query(int L, int R)
{
if(L == R) return a[L];
return get(1, 0, n - 1, L, R);
}
