#include <bits/stdc++.h>
using namespace std;
const long double PI = 3.141592653589793;
const long double E = 2.71828182845904523;
const long long LLINF = 4000000009000000099;
const long long INF = 1009000099;
const long long MOD7 = 1000000007;
const long long MOD9 = 1000000009;
template <class A, class B, class C>
struct triple {
  A first;
  B second;
  C third;
  triple(A, B, C);
  triple();
};
template <class A, class B, class C>
triple<A, B, C>::triple(A a, B b, C c) {
  first = a;
  second = b;
  third = c;
}
template <class A, class B, class C>
triple<A, B, C>::triple() {}
template <class A, class B, class C>
triple<A, B, C> make_triple(A a, B b, C c) {
  triple<A, B, C> t(a, b, c);
  return t;
}
template <class A, class B, class C>
bool operator<(triple<A, B, C> a, triple<A, B, C> b) {
  if (a.first != b.first) return a.first < b.first;
  if (a.second != b.second) return a.second < b.second;
  if (a.third != b.third) return a.third < b.third;
}
template <class T>
T inline sqr(T a) {
  return a * a;
}
long long bpow(long long a, long long d, long long mod) {
  if (d == 0) return 1;
  long long t = bpow(a, d / 2, mod);
  t = (t * t) % mod;
  if (d & 1) t = (t * a) % mod;
  return t;
}
long long bpow(long long a, long long d) {
  if (d == 0) return 1;
  long long t = bpow(a, d / 2);
  t = (t * t);
  if (d & 1) t = (t * a);
  return t;
}
long long gcd(long long a, long long b) {
  while (a && b)
    if (a > b)
      a %= b;
    else
      b %= a;
  return a + b;
}
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
long long C(long long n, long long k) {
  long long res = 1;
  for (int i = 1; i <= k; ++i) res = res * (n - k + i) / i;
  return res;
}
long long C(long long n, long long k, long long mod) {
  long long u = 1, d = 1;
  for (int i = 2; i <= n; ++i) u = (u * i) % mod;
  int x = max(k, n - k), z = min(k, n - k);
  for (int i = 2; i <= x; ++i) {
    d = (d * i) % mod;
    if (i <= z) d = (d * i) % mod;
  }
  d = bpow(d, mod - 2, mod);
  long long res = (u * d) % mod;
  return res;
}
const int sz = 5010;
vector<vector<int>> c(sz, vector<int>(sz + 1));
vector<vector<int>> uc(sz);
vector<vector<int>> ans;
vector<int> v;
void calc(int i, int j) {
  if (ans[i][j] != -1)
    return;
  else {
    if (i == j)
      ans[i][i] = v[i];
    else {
      calc(i + 1, j);
      calc(i, j - 1);
      ans[i][j] = max(ans[i + 1][j], ans[i][j - 1]);
      int d = j - i + 1;
      int val = 0;
      for (int k = 0; k < uc[d - 1].size(); ++k) val ^= v[i + uc[d - 1][k]];
      ans[i][j] = max(ans[i][j], val);
    }
  }
}
void solve() {
  c[0][0] = 1;
  for (int i = 1; i < sz; ++i) {
    c[i][0] = c[i][i] = 1;
    for (int j = 1; j < i; ++j) c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) & 1;
    for (int j = 0; j <= i; ++j)
      if (c[i][j]) uc[i].push_back(j);
  }
  int n;
  cin >> n;
  v.resize(n);
  for (int i = 0; i < n; ++i) cin >> v[i];
  ans.resize(n, vector<int>(n, -1));
  for (int i = 0; i < n; ++i)
    for (int j = i; j < n; ++j) calc(i, j);
  int q;
  cin >> q;
  for (int i = 0; i < q; ++i) {
    int l, r;
    cin >> l >> r;
    l--, r--;
    cout << ans[l][r] << "\n";
  }
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  solve();
  return 0;
}
