#include <bits/stdc++.h>
using namespace std;
int Secret(int X, int Y);
int ans[1005][1005], N;
void calc (int l, int r) {
if (l == r) return;
int mid = (l+r)/2;
for (int i = mid-1; i >= l; i--) if (ans[i][mid] == -1) ans[i][mid] = Secret(i, mid);
for (int i = mid+2; i <= r; i++) if (ans[mid+1][i] == -1) ans[mid+1][i] = Secret(mid+1, i);
calc(l, mid);
calc(mid+1, r);
}
void Init (int n, int A[]) {
N = n;
for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) ans[i][j] = -1;
for (int i = 0; i < n; i++) ans[i][i] = A[i];
calc(0, n-1);
}
int solve (int l, int r, int ql, int qr) {
int mid = (l+r)/2;
if (qr <= mid) return solve(l, mid, ql, qr);
if (mid+1 <= l) return solve(mid+1, r, ql, qr);
return Secret(ans[ql][mid], ans[mid+1][qr]);
}
int Query (int L, int R) {
if (ans[L][R] != -1) return ans[L][R];
return solve(0, N-1, L, R);
}
