#include "secret.h"
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#include <queue>
#include <stack>
#include <deque>
#include <random>
using namespace std;
template<typename T1, typename T2>inline void chkmin(T1 &x, T2 y) { if (x > y) x = y; }
template<typename T1, typename T2>inline void chkmax(T1 &x, T2 y) { if (x < y) x = y; }
#define sz(c) (int)(c).size()
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define left left224
#define right right224
#define next next224
#define rank rank224
#define prev prev224
#define y1 y1224
#define read(FILENAME) freopen((FILENAME + ".in").c_str(), "r", stdin)
#define write(FILENAME) freopen((FILENAME + ".out").c_str(), "w", stdout)
#define files(FILENAME) read(FILENAME), write(FILENAME)
#define pb push_back
#define mp make_pair
const int MAXN = 1001;
int n;
int val[MAXN][10];
void Init(int N, int A[]) {
n = N;
for (int i = 0; i < n; i++) {
val[i][0] = A[i];
}
for (int k = 1; k <= 9; k++) {
for (int i = 0; i <= n - (1 << k); i++) {
val[i][k] = Secret(val[i][k - 1], val[i + (1 << (k - 1))][k - 1]);
}
}
}
int Query(int L, int R) {
int l = L;
int r = R;
int last = -1;
for (int i = 9; i >= 0; i--) {
if (l + (1 << i) - 1 <= r) {
if (last == -1) {
last = val[l][i];
} else {
last = Secret(last, val[l][i]);
}
l += (1 << i);
}
}
return last;
}
