#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
typedef long long ll;
const int N=5e4+5, M=300;
inline int read(){char c=getchar();int x=0,f=1;while(c<'0'||c>'9'){if(c=='-')f=-1; c=getchar();}while(c>='0'&&c<='9'){x=x*10+c-'0'; c=getchar();}return x*f;
}int n, a[N], Q, mp[N], l, r;
struct meow{int l,r;} b[M];
int block, m, pos[N];
inline void ini(){block=sqrt(n); m=(n-1)/block+1;for(int i=1;i<=n;i++) pos[i]=(i-1)/block+1;for(int i=1;i<=m;i++) b[i].l=(i-1)*block+1, b[i].r=i*block;b[m].r=n;
}
struct Block{int c[N];inline void add(int p,int v) {for(;p<=*mp;p+=(p&-p)) c[p]+=v;}inline int sum(int p) {int re=0; for(;p;p-=(p&-p)) re+=c[p]; return re;}int f[M][N], s[M][N];void Set(int x){for(int i=b[x].l; i<=n; i++)f[x][i]= f[x][i-1]+sum(*mp)-sum(a[i]), add(a[i], 1);// printf("f %d %d  %d\n",x,i,f[x][i]);memset(c, 0, sizeof(c));for(int i=b[x].l; i<=b[x].r; i++) s[x][a[i]]++; for(int i=1; i<=*mp; i++) s[x][i]+= s[x][i-1];for(int i=1; i<=*mp; i++) s[x][i]+= s[x-1][i];// printf("s %d %d  %d\n",x,i,s[x][i]);;
    }int Que(int l,int r){int pl=pos[l], pr=pos[r];int ans=0;if(pl==pr){for(int i=l;i<=r;i++) ans+= sum(*mp)-sum(a[i]), add(a[i], 1);for(int i=l;i<=r;i++) add(a[i], -1);}else{ans= f[pl+1][r]; //printf("ans %d \n",ans);for(int i=b[pr].l; i<=r; i++) add(a[i], 1);for(int i=b[pl].r; i>=l; i--) ans+= sum(a[i]-1) + s[pr-1][a[i]-1] - s[pl][a[i]-1], add(a[i], 1);for(int i=b[pr].l; i<=r; i++) add(a[i], -1);for(int i=l; i<=b[pl].r; i++) add(a[i], -1);}return ans;}
}B;
int main(){freopen("in","r",stdin);n=read();for(int i=1;i<=n;i++) a[i]=mp[i]=read();sort(mp+1, mp+1+n); *mp=unique(mp+1, mp+1+n) - mp - 1;for(int i=1;i<=n;i++) a[i]=lower_bound(mp+1, mp+1+*mp, a[i]) - mp;//for(int i=1;i<=n;i++) printf("%d ",a[i]); puts("");
    ini();for(int i=1;i<=m;i++) B.Set(i);Q=read(); int lastans=0;while(Q--){//l=read(), r=read();l=read()^lastans, r=read()^lastans;if(l>r) swap(l, r);lastans=B.Que(l, r); printf("%d\n",lastans);}
}