from bisect import bisect_left, bisect_right

LOG = 17
MAX_N = 2**LOG # 131072
INF = 10**9

N = int(input())
A = [*map(int, input().split())]
ap = [[] for _ in range(MAX_N)]
for i in range(N):
    ap[A[i]].append(i)

treeL = [[[] for _ in range(2*MAX_N)] for __ in range(3)]
treeR = [[[] for _ in range(2*MAX_N)] for __ in range(3)]
interval = [(-1, -1)] * 2 * MAX_N

for t in range(1, 2*MAX_N):
    if t == 1: l, r = 0, MAX_N
    else:
        pl, pr = interval[t//2]
        if t&1: l, r = (pl + pr) >> 1, pr
        else: l, r = pl, (pl + pr) >> 1
        
    idx = []
    for x in range(l, r):
        for i in ap[x]:
            idx.append(i)
    idx.sort()
    
    for c in range(1, 4):
        cnt = [0] * (r - l)
        R, now = 0, 0
        for i in range(len(idx)):
            assert i <= R

            while R < len(idx) and now < r - l:
                pos = A[idx[R]] - l
                cnt[pos] += 1
                if cnt[pos] == c:
                    now += 1
                R += 1

            if now == r - l:
                treeL[c-1][t].append(idx[i])
                treeR[c-1][t].append(idx[R-1])
            
            if cnt[A[idx[i]]-l] == c:
                now -= 1

            cnt[A[idx[i]]-l] -= 1

        treeL[c-1][t].append(INF)
        treeR[c-1][t].append(INF)
    
    interval[t] = (l, r)

def query(l, r):
    mex = []
    for c in range(1, 4):
        ptr = 2
        while ptr < 2*MAX_N:
            L, R = interval[ptr]
            p = bisect_left(treeL[c-1][ptr], l)
            p = treeR[c-1][ptr][p]
            if p < r: ptr = (ptr^1)*2
            else: ptr <<= 1
        mex.append(ptr//2 - MAX_N)
    return mex

Q = int(input())
ansi = 0
for _ in range(Q):
    alpha, beta = map(int, input().split())
    l, r = alpha ^ ansi, beta ^ ansi
    mex1, mex2, mex3 = query(l-1, r)
    ansi = mex1+mex2+mex3
    if mex2 == 0: ansi = min(ansi, r-l-1)
    if mex3 == 0: ansi = min(ansi, r-l)
    print(ansi)