class Doubling:
    def __init__(self, xs: list, nb=60):
        size = len(xs)
        doubling = [[0] * size for _ in range(nb)]
        for i in range(size):
            doubling[0][i] = xs[i]

        for k in range(nb-1):
            for i in range(size):
                doubling[k+1][i] = doubling[k][doubling[k][i]]

        self.nb = nb
        self.doubling = doubling

    def query(self, k: int, start: int) -> int:
        cur = start
        for i in range(self.nb):
            if k & (1 << i):
                cur = self.doubling[i][cur]

        return cur


from bisect import bisect_right
from itertools import accumulate

N = int(input())
H = list(map(int, input().split()))
T = list(map(int, input().split()))
Q = int(input())

cities = [(h, t, i) for i, (h, t) in enumerate(zip(H, T))]
cities.sort()

acc = list(accumulate([(t, i) for _, t, i in cities], func=max))
# print(f'{acc=}')
# exit()

nexts = []
for i in range(N):
    # 街 i の次への遷移を求める
    # テレポート可能な街のうち、最も h の高い街を求める
    p = bisect_right(cities, T[i], key=lambda x: x[0])
    if p == 0:  # どこにも移動出来ない
        nexts.append(i)
    else:
        # t, ci = segt.prod(0, p)
        t, ci = acc[p-1]
        if t > T[i]:
            nexts.append(ci)  # テレポートするとより高く移動できる
        else:
            nexts.append(i)  # 現状より高い位置に移動出来ない

d = Doubling(nexts)
for _ in range(Q):
    A, B = map(lambda x: int(x)-1, input().split())

    k = 10**18
    ci = d.query(k, A)

    # 街 B の高さに届かない
    if H[B] > T[ci]:
        print(-1)
        continue

    lo = 0
    hi = k
    res = k
    while lo <= hi:
        m = (lo + hi) // 2
        ci = d.query(m, A)
        if T[ci] >= H[B]:
            res = min(res, m)
            hi = m - 1
        else:
            lo = m + 1

    print(res+1)