class SegmentTree:
    def __init__(self, init_val, segfunc, ide_ele):
        n = len(init_val)
        self.segfunc = segfunc
        self.ide_ele = ide_ele
        self.num = 1 << (n - 1).bit_length()
        self.tree = [ide_ele] * 2 * self.num
        self.size = n
        for i in range(n):
            self.tree[self.num + i] = init_val[i]
        for i in range(self.num - 1, 0, -1):
            self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])

    def update(self, k, x):
        k += self.num
        self.tree[k] = self.segfunc(self.tree[k],x)
        while k > 1:
            k >>= 1
            self.tree[k] = self.segfunc(self.tree[2*k], self.tree[2*k+1])

    def query(self, l, r):
        if r==self.size:
            r = self.num

        res = self.ide_ele

        l += self.num
        r += self.num
        right = []
        while l < r:
            if l & 1:
                res = self.segfunc(res, self.tree[l])
                l += 1
            if r & 1:
                right.append(self.tree[r-1])
            l >>= 1
            r >>= 1

        for e in right[::-1]:
            res = self.segfunc(res,e)
        return res
    
    def bisect(self,l,r,x):
        if r==self.size:
            r = self.num
        l += self.num
        r += self.num
        segment = []
        segment_r = []
        while l<r:
            if l&1:
                segment.append(l)
                l += 1
            if r&1:
                segment_r.append(r-1)
            l >>= 1
            r >>= 1
        segment += segment_r[::-1]
        tmp = self.ide_ele
        for pos in segment:
            check = self.segfunc(tmp,self.tree[pos])
            if check >= x:
                break
            else:
                tmp = check
        else:
            return -1
        
        while pos < self.num:
            check = self.segfunc(tmp,self.tree[2*pos])
            if check >= x:
                pos = 2 * pos
            else:
                tmp = check
                pos = 2 * pos + 1
        return pos - self.num

import sys,random
from collections import deque

input = lambda :sys.stdin.readline().rstrip()
mi = lambda :map(int,input().split())
li = lambda :list(mi())

N = int(input())
P = li()
Q = int(input())
query = [[] for i in range(N+1)]
for i in range(Q):
    x,y = mi()
    query[x].append((y,i))

pos = [-1] * (N+1)
for i in range(N):
    pos[P[i]] = i

fw = SegmentTree([0]*(N+1),lambda x,y:x+y,0)
add_time = [[] for i in range(N+1)]
for i in range(N):
    t = fw.query(0,P[i])
    add_time[t].append(i)
    fw.update(P[i],1)

idx_set = SegmentTree([0]*(N+1),lambda x,y:x+y,0)
val_set = SegmentTree([0]*(N+1),lambda x,y:x+y,0)
cond = [0] * (N+1)
n = 0
for i in add_time[0]:
    idx_set.update(i,1)
    val_set.update(P[i],1)
    cond[P[i]] = 1
    n += 1

ans = [-1]*Q
for t in range(1,N+1):
    idx_set.update(t-1,-1)
    val_set.update(t,-1)
    cond[t] = 2
    n -= 1
    for i in add_time[t]:
        idx_set.update(i,1)
        val_set.update(P[i],1)
        cond[P[i]] = 1
        n += 1
    for y,idx in query[t]:
        if cond[y]==0:
            ans[idx] = pos[y] + 1
        elif cond[y]==1:
            k = val_set.query(0,y+1)
            ans[idx] = idx_set.bisect(0,N+1,n-k+1) + 1

print(*ans,sep="\n")