#include <bits/stdc++.h>

#define P pair<int, int>

#define F first

#define S second

using namespace std;

const int MAX_N = 5e5 + ;

const int MAX_B =  + ;

int n, q;

int c[MAX_N];

int bas[MAX_B], pos[MAX_B];

int ans[MAX_N];

vector <P> eve[MAX_N];

inline bool base(int x, int pos) {

    return (x >> pos) & ;

}

int main()

{

    ios::sync_with_stdio(false);

    cin.tie(nullptr);

    cout.tie(nullptr);

    cin >> n;

    for (int i = ; i <= n; i++)

        cin >> c[i];

    cin >> q;

    for (int i = , l, r; i <= q; i++) {

        cin >> l >> r;

        eve[r].push_back(P(l, i));

    }

    for (int i = ; i <= n; i++) {

        int x = c[i], p = i;

        for (int b = ; b >= ; b--) {

            if (base(x, b)) {

                if (!bas[b]) {

                    bas[b] = x;

                    pos[b] = p;

                    break;

                }

                if (pos[b] < p) swap(bas[b], x), swap(pos[b], p);

                x ^= bas[b];

            }

        }

        for (auto &p : eve[i])

            for (int b = ; b >= ; b--)

                if (p.F <= pos[b])

                    ans[p.S] = max(ans[p.S], ans[p.S]^bas[b]);

    }

    for (int i = ; i <= q; i++)

        cout << ans[i] << '\n';

    return ;

}