#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=0){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
    if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
    else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}
template<class T> bool inside(T l,T x,T r){return l<=x&&x<r;}



void solve();
// CYAN / FREDERIC
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    int N;
    cin >> N;
    vector<int> A(N), C(N);
    rep(i, 0, N) cin >> A[i];
    const int D = 3;
    const int M = 100'010;
    vector<vector<int>> G(M);
    vector<int> ind(M);
    rep(i, 0, N){
        G[A[i]].push_back(i);
    }
    rep(i, 0, M) rep(j, 0, D) G[i].push_back(N);
    const int B = 300;
    vector<vector<int>> sq_val(D);
    vector val(D, vector<int>(N + 1, INF));
    rep(i, 0, D) rep(j, 0, M) chmin(val[i][G[j][i]], j);
    // rep(i, 0, D) vec_out(val[i]);
    rep(i, 0, N){
        if (i % B == 0){
            int tmp = i / B;
            rep(j, 0, D){
                sq_val[j].insert(sq_val[j].end(), all(val[j]));
                for (int k = N; k > 0; k--){
                    chmin(sq_val[j][k - 1 + tmp * (N + 1)], sq_val[j][k + tmp * (N + 1)]);
                }
            }
        }
        C[i] = ind[A[i]];
        ind[A[i]]++;
        rep(j, 0, D){
            chmin(val[j][G[A[i]][ind[A[i]] + j]], A[i]);
        }
    }
    int Q;
    cin >> Q;
    ll F = 0;
    rep(rp, 0, Q){
        ll l, r;
        cin >> l >> r;
        l ^= F, r ^= F;
        l--;
        int st = l / B;
        vector<int> ans(D);
        rep(i, 0, D) ans[i] = sq_val[i][st * (N + 1) + r];
        // cout << l << " " << r << endl;
        // rep(i, 0, D) cout << ans[i] << " ";
        // cout << endl;
        rep(i, st * B, l){
            rep(j, 0, D){
                if (G[A[i]][C[i] + j + 1] >= r){
                    chmin(ans[j], A[i]);
                }
            }
        }
        F = vec_sum(ans);
        int tmp = 0;
        rep(i, 0, 3) if (ans[i] == 0) tmp++;
        chmin(F, r - l - tmp);
        cout << F << endl;
    }
}