import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = (1 << 63)-1
# inf = (1 << 31)-1
# md = 10**9+7
md = 998244353

from bisect import bisect_left

n = II()
hh = LI()
tt = LI()

vv = sorted(set(tt))
vtoi = {v: i for i, v in enumerate(vv)}
to = [0]*len(vv)
uh = sorted(enumerate(hh), key=lambda x: x[1])
vi = 0
mx = -1
for u, h in uh:
    while vi < len(vv) and h > vv[vi]:
        if mx != -1:
            to[vi] = vtoi[mx]
        vi += 1
    mx = max(mx, tt[u])
while vi < len(vv):
    if mx != -1:
        to[vi] = vtoi[mx]
    vi += 1
# pDB(vv)
# pDB(to)

log = n.bit_length()
db = [[-1]*len(vv) for _ in range(log)]
db[0] = to
for i in range(log-1):
    for j in range(len(vv)):
        nj = db[i][j]
        if nj == -1: continue
        db[i+1][j] = db[i][nj]

for _ in range(II()):
    u, v = LI1()
    h = hh[u]
    g = hh[v]
    i = vtoi[tt[u]]
    j = bisect_left(vv, g)
    if j <= i:
        print(1)
        continue

    ans = 2
    for lv in range(log)[::-1]:
        if db[lv][i] == -1: continue
        if db[lv][i] < j:
            i = db[lv][i]
            ans += 1 << lv
    if db[0][i]<j:
        print(-1)
    else:
        print(ans)