#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using namespace std;
using ll=long long;
using mint=modint998244353;
const int b=320;
int d,w,n;
ll m=100001;
ll op(ll x,ll y){
    return min(x%m,y%m)+min(x/m%m,y/m%m)*m+min(x/m/m,y/m/m)*m*m;
}
ll e(){
    return n*m*m+n*m+n;;
}

bool F(ll x){
    if(x==e())return true;
    if(w==0)return x%m>=d;
    else if(w==1) return x/m%m>=d;
    else return x/m/m>=d;
}
int main()
{
    cin>>n;
    vector<int> a(n);
    for(int i=0;i<n;i++)cin>>a[i];
    for(int i=0;i<n;i++)a[i]=min(a[i],n);
    vector<segtree<ll,op,e>> stv((n+b)/b);
    stv[0]=segtree<ll,op,e>(vector<ll>(n+1,0));
    for(int i=1;i<(n+b)/b;i++){
        stv[i]=stv[i-1];
        for(int j=(i-1)*b;j<min(n,i*b);j++){
            ll t=stv[i].get(a[j]);
            ll new_t=t/m%m*m*m+t%m*m+j+1;
            stv[i].set(a[j],new_t);
        }
    }
    ll key=0;
    int q;
    cin>>q;
    while(q--){
        ll x,y;
        cin>>x>>y;
        x^=key;y^=key;
        x--;
        int p=y/b;
        vector<pair<int,ll>> rec;
        set<int> s;
        for(int i=p*b;i<y;i++){
            ll t=stv[p].get(a[i]);
            if(!s.count(a[i])) rec.push_back(make_pair(a[i],t));
            s.insert(a[i]);
            ll new_t=t/m%m*m*m+t%m*m+i+1;
            stv[p].set(a[i],new_t);
        }
        int ans=0;
        for(int i=0;i<3;i++){
            d=x+1;
            w=i;
            ans+=min((ll)(stv[p].max_right<F>(0)),y-x-2);
        }
        cout<<ans<<endl;
        key=ans;
        for(auto[x,t]:rec){
            stv[p].set(x,t);
        }
    }

    
    return 0;
}