#include <bits/stdc++.h>
#include "secret.h"
using namespace std;
const int mxN = 1005;
int a[mxN], dp[mxN][mxN], n;
unordered_map<int, unordered_map<int, int>> mp;
void Init(int N, int A[]) {
n = N;
memset(dp, -1, sizeof(dp));
for(int i = 0; i < n; ++i){
a[i] = A[i];
dp[i][i] = A[i];
}
}
int get(int x, int y){
if(x == -1) return y;
if(y == -1) return x;
if(mp.count(x)){
if(mp[x].count(y)){
return mp[x][y];
}
}
return mp[x][y] = Secret(x, y);
}
int solve(int l, int r){
if(l > r) return -1;
if(dp[l][r] != -1) return dp[l][r];
if(l + 1 == r) return dp[l][r] = get(a[l], a[r]);
int mid = (l + r) / 2;
int left = solve(l, mid), right = solve(mid + 1, r);
return dp[l][r] = get(left, right);
}
int Query(int L, int R) {
return solve(L, R);
}
