#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
typedef long long LL;

const int N = 1e6 + 10;

LL n, q, arr[N], pre_xor[N];

int main()
{
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);

    cin>>n;
    for(int i=1; i<=n; i++)
    {
        cin>>arr[i];
        pre_xor[i] = pre_xor[i-1] ^ arr[i];
    }
    cin>>q;
    while(q--)
    {
        LL l, r;
        cin>>l>>r;
        l = l % (LL)(n+1);
        r = r % (LL)(n+1);
        if(l == 0 and r == 0)
        {
            cout<<pre_xor[n]<<endl;
        }
        else if(l == 0)
        {
            LL cur_xor = pre_xor[r] ^ pre_xor[n];
            cout<<cur_xor<<endl;
        }
        else if(r == 0)
        {
            LL cur_xor = pre_xor[l-1];
            cout<<cur_xor<<endl;
        }
        else if(l <= r)
        {
            LL cur_xor = pre_xor[r] ^ pre_xor[l-1];
            cout<<cur_xor<<endl;
        }
        else
        {
            LL baki_right = pre_xor[l-1];
            LL baki_left = pre_xor[r];
            LL cur_xor = baki_left ^ baki_right;
            cout<<cur_xor<<endl;
        }
    }
}

/*

5
3 3 4 3 2
1
6 7

*/