#include <bits/stdc++.h>
using namespace std;
long long mod = 1000000007;
long long mod2 = 998244353;
long long mod3 = 1000003;
long long mod4 = 998244853;
long long mod5 = 1000000009;
long long inf = 1LL << 62;
double pi = 3.141592653589793238462643383279L;
double eps = 1e-14;
int dh[4] = {1, -1, 0, 0};
int dw[4] = {0, 0, 1, -1};
int ddh[8] = {-1, -1, -1, 0, 0, 1, 1, 1};
int ddw[8] = {-1, 0, 1, -1, 1, -1, 0, 1};
struct custom_hash {
  static uint64_t splitmix64(uint64_t x) {
    x += 0x9e3779b97f4a7c15;
    x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
    x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
    return x ^ (x >> 31);
  }
  size_t operator()(uint64_t x) const {
    static const uint64_t FIXED_RANDOM =
        chrono::steady_clock::now().time_since_epoch().count();
    return splitmix64(x + FIXED_RANDOM);
  }
};
long long gcd(long long a, long long b) {
  if (a < b) swap(a, b);
  if (b == 0) return a;
  if (a % b == 0) return b;
  return gcd(b, a % b);
}
long long lcm(long long a, long long b) {
  long long c = gcd(a, b);
  return a * b / c;
}
long long Pow(long long n, long long k) {
  long long ret = 1;
  long long now = n;
  while (k > 0) {
    if (k & 1) ret *= now;
    now *= now;
    k /= 2;
  }
  return ret;
}
long long beki(long long n, long long k, long long md) {
  long long ret = 1;
  long long now = n;
  now %= md;
  while (k > 0) {
    if (k % 2 == 1) {
      ret *= now;
      ret %= md;
    }
    now *= now;
    now %= md;
    k /= 2;
  }
  return ret;
}
long long gyaku(long long n, long long md) { return beki(n, md - 2, md); }
long long popcount(long long n) {
  long long ret = 0;
  long long u = n;
  while (u > 0) {
    ret += u % 2;
    u /= 2;
  }
  return ret;
}
int c[500010];
int le[500010], ri[500010];
vector<int> ki[500010];
vector<int>& add(vector<int>& v, int a) {
  for (int i = 0; i < v.size(); i++) a = min(a, v[i] ^ a);
  if (a > 0) v.push_back(a);
  return v;
}
int ans[500010];
void dfs(int l, int r, vector<int>& v) {
  if (v.size() == 0) return;
  if (r - l == 1) {
    for (int i = 0; i < v.size(); i++) ans[v[i]] = c[l];
    return;
  }
  vector<int> a[3];
  int mid = (l + r) / 2;
  for (int i = 0; i < v.size(); i++) {
    int num = v[i];
    if (ri[num] <= mid)
      a[0].push_back(num);
    else if (le[num] >= mid)
      a[1].push_back(num);
    else
      a[2].push_back(num);
  }
  if (a[2].size()) {
    vector<int> w;
    for (int i = mid; i < r; i++) {
      ki[i] = add(w, c[i]);
    }
    w.clear();
    for (long long i = mid - 1; i >= l; i--) ki[i] = add(w, c[i]);
    for (int i : a[2]) {
      vector<int> now = ki[le[i]];
      for (int j : ki[ri[i] - 1]) {
        add(now, j);
      }
      ans[i] = 0;
      for (int j : now) ans[i] = max(ans[i], j ^ ans[i]);
    }
  }
  dfs(l, mid, a[0]);
  dfs(mid, r, a[1]);
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) cin >> c[i];
  int q;
  cin >> q;
  vector<int> v;
  for (int i = 0; i < q; i++) {
    cin >> le[i] >> ri[i];
    le[i]--;
    v.push_back(i);
  }
  dfs(0, n, v);
  for (int i = 0; i < q; i++) cout << ans[i] << "\n";
}
