#include <bits/stdc++.h>
#pragma GCC optimize("O3")
typedef long long ll;
#define FOR(i,x,y) for(ll i=x; i<y; i++)
#define FORNEG(i,x,y) for(ll i=x; i>y; i--)
#define double long double
#include "secret.h"
using namespace std;
vector<vector<ll>> sus(1025);
vector<ll> nums(1025);
ll n;
// int Secret(ll a, ll b){
// return a+floor(b/2)*2;
// }
void sussy(ll a, ll b){
if (b-a > 2){
ll mid = (a+b)/2;
vector<ll> left;
vector<ll> right;
left.push_back(nums[mid-1]);
FORNEG(i, mid-2, a-1){
left.push_back(Secret(nums[i], left[left.size()-1]));
}
right.push_back(nums[mid]);
FOR(i,mid+1, b){
right.push_back(Secret(right[right.size()-1], nums[i]));
}
reverse(left.begin(), left.end());
for (auto&i : left){
sus[mid].push_back(i);
}
for (auto&i : right){
sus[mid].push_back(i);
}
sussy(a, mid);
sussy(mid, b);
}
}
void Init(int N, int A[]) {
n = N;
FOR(i,0,1025) nums[i] = 1;
FOR(i,0,N) nums[i] = A[i];
sussy(0,n);
}
int Query(int L, int R){
if (R == L+1){
return Secret(nums[L], nums[R]);
}
if (L==R){
return nums[L];
}
ll lo = 0;
ll hi = n;
while (lo<hi){
ll mid = (lo+hi)/2;
if (L<=mid && mid<=R){
ll size = sus[mid].size()/2;
return Secret(sus[mid][size - (mid - L)], sus[mid][size+(R-mid)]);
}
if (mid<=L && mid<=R){
lo = mid;
}
if (mid >= L && mid >= R){
hi = mid;
}
}
}
// int main(){
// int sussy[8] = {1,4,7,2,5,8,3,6};
// Init(8, sussy);
// cout << Query(0,3) << endl;
// cout << Query(1,7) << endl;
// cout << Query(5,5) << endl;
// cout << Query(2,4) << endl;
// }
