#include<bits/stdc++.h>
#include "secret.h"
using namespace std;
const int MAXN = 1005;
int peal[MAXN][MAXN];
void Solve(int left, int right)
{
if (left + 1 == right)
{
return;
}
int mid = (left + right) / 2;
for (int i = mid - 1; i >= left; i--)
{
if (peal[i][mid] == -1)
{
peal[i][mid] = Secret(peal[i][i + 1], peal[i + 1][mid]);
}
}
for (int i = mid + 1; i <= right; i++)
{
if (peal[mid][i] == -1)
{
peal[mid][i] = Secret(peal[mid][i - 1], peal[i - 1][i]);
}
}
Solve(left, mid);
Solve(mid + 1, right);
}
void Init(int N, int A[])
{
for (int i = 0; i < N; i++)
{
for (int j = 0; j < N; j++)
{
peal[i][j] = -1;
}
}
for (int i = 0; i < N; i++)
{
peal[i][i + 1] = A[i];
}
Solve(0, N);
}
int Query(int L, int R)
{
for (int i = L + 1; i <= R; i++)
{
if (peal[L][i] != -1 && peal[i][R + 1] != -1)
{
return Secret(peal[L][i], peal[i][R + 1]);
}
}
return peal[L][R + 1];
}
