#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#define N 100010
using namespace std;
int a[N] , v[N] , sum[250][N] , f[N] , n , ls[N << 4] , rs[N << 4] , si[N << 4] , root[N] , tot;
void update(int x)
{int i;for(i = x ; i <= n ; i += i & -i) f[i] ++ ;
}
int query(int x)
{int i , ans = 0;for(i = x; i ; i -= i & -i) ans += f[i];return ans;
}
void insert(int p , int l , int r , int x , int &y)
{y = ++tot , si[y] = si[x] + 1;if(l == r) return;int mid = (l + r) >> 1;if(p <= mid) rs[y] = rs[x] , insert(p , l , mid , ls[x] , ls[y]);else ls[y] = ls[x] , insert(p , mid + 1 , r , rs[x] , rs[y]);
}
int calc(int p , int l , int r , int x , int y)
{if(l > p) return 0;if(r <= p) return si[y] - si[x];int mid = (l + r) >> 1;return calc(p , l , mid , ls[x] , ls[y]) + calc(p , mid + 1 , r , rs[x] , rs[y]);
}
int main()
{int m , i , j , si , last = 0 , x , y , ans;scanf("%d" , &n) , si = (int)sqrt(n);for(i = 0 ; i < n ; i ++ ) scanf("%d" , &a[i]) , v[i] = a[i];sort(v , v + n);for(i = 0 ; i < n ; i ++ ) a[i] = lower_bound(v , v + n , a[i]) - v , insert(a[i] , 0 , n - 1 , root[i] , root[i + 1]);for(i = 0 ; i <= n / si ; i ++ ){memset(f , 0 , sizeof(f)) , update(n - a[i * si]);for(j = i * si + 1 ; j < n ; j ++ ) sum[i][j] = sum[i][j - 1] + query(n - a[j] - 1) , update(n - a[j]);}scanf("%d" , &m);while(m -- ){scanf("%d%d" , &x , &y) , x = (x ^ last) - 1 , y = (y ^ last) - 1 , ans = 0;if(x / si == y / si)for(i = y - 1 ; i >= x ; i -- )ans += calc(a[i] - 1 , 0 , n - 1 , root[i + 1] , root[y + 1]);else{ans += sum[x / si + 1][y];for(i = (x / si + 1) * si - 1 ; i >= x ; i -- )ans += calc(a[i] - 1 , 0 , n - 1 , root[i + 1] , root[y + 1]);}printf("%d\n" , last = ans);}return 0;
}