#include <bits/stdc++.h>
using namespace std;
int SET(int n, int pos) { return n = n | (1 << pos); }
int RESET(int n, int pos) { return n = n & ~(1 << pos); }
int CHECK(int n, int pos) { return (bool)(n & (1 << pos)); }
int str2int(string s) {
  stringstream ss(s);
  int x;
  ss >> x;
  return x;
}
string int2str(int a) {
  stringstream ss;
  ss << a;
  string str = ss.str();
  return str;
}
string char2str(char a) {
  stringstream ss;
  ss << a;
  string str = ss.str();
  return str;
}
long long int bigMod(long long int n, long long int power, long long int MOD) {
  if (power == 0) return 1;
  if (power % 2 == 0) {
    long long int ret = bigMod(n, power / 2, MOD);
    return ((ret % MOD) * (ret % MOD)) % MOD;
  } else
    return ((n % MOD) * (bigMod(n, power - 1, MOD) % MOD)) % MOD;
}
long long int modInverse(long long int a, long long int m) {
  long long int m0 = m, t, q;
  long long int x0 = 0, x1 = 1;
  if (m == 1) return 0;
  while (a > 1) {
    q = a / m;
    t = m;
    m = a % m, a = t;
    t = x0;
    x0 = x1 - q * x0;
    x1 = t;
  }
  if (x1 < 0) x1 += m0;
  return x1;
}
int POW(int x, int y) {
  int res = 1;
  for (; y;) {
    if ((y & 1)) {
      res *= x;
    }
    x *= x;
    y >>= 1;
  }
  return res;
}
int inverse(int x) {
  double p = ((double)1.0) / x;
  return (p) + 1e-9;
}
int gcd(int a, int b) {
  while (b) b ^= a ^= b ^= a %= b;
  return a;
}
int nC2(int n) { return n * (n - 1) / 2; }
long long int MOD(long long int n, long long int mod) {
  if (n >= 0)
    return n % mod;
  else if (-n == mod)
    return 0;
  else
    return mod + (n % mod);
}
int n, data[5005], dp[5005][5005], dp_ans[5005][5005];
int main() {
  int t, cas = 0;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%d", &data[i + 1]);
  }
  for (int i = 1; i < n; i++) {
    dp[1][i] = data[i] ^ data[i + 1];
    dp_ans[1][i] = max(dp[1][i], max(data[i], data[i + 1]));
  }
  int p = n - 1;
  for (int i = 2; i < n; i++) {
    for (int j = 1; j < p; j++) {
      dp[i][j] = dp[i - 1][j] ^ dp[i - 1][j + 1];
      dp_ans[i][j] = max(dp[i][j], max(dp_ans[i - 1][j], dp_ans[i - 1][j + 1]));
    }
    p--;
  }
  int q;
  scanf("%d", &q);
  while (q--) {
    int l, r;
    scanf("%d %d", &l, &r);
    if (l == r) {
      printf("%d\n", data[l]);
      continue;
    }
    r--;
    printf("%d\n", dp_ans[r - l + 1][l]);
  }
  return 0;
}
