import bisect

n = int(input())
h = list(map(int,input().split()))
t = list(map(int,input().split()))
g = [(h[i] << 31) + (1 << 30) - t[i] for i in range(n)]
g.sort()

hs = [g[i] >> 31 for i in range(n)]
ts = [(1 << 30) - (g[i] & ((1 << 31) - 1)) for i in range(n)]
dp = [[0] * n for i in range(30)]

tmp = 0
for i in range(n):
	tmp = max(tmp, ts[i])
	dp[0][i] = bisect.bisect_right(hs, tmp) - 1

for i in range(29):
	for j in range(n):
		if dp[i][j] >= 0:
			dp[i+1][j] = max(dp[i][j], dp[i][dp[i][j]])
		else:
			dp[i+1][j] = -1

#print(dp)

q = int(input())
for i in range(q):
	a, b = map(int,input().split())
	a -= 1
	b -= 1
	f = 1
	r = bisect.bisect_right(hs, t[a]) - 1
	if r == -1:
		print(-1)
		continue
	if hs[r] >= h[b]:
		print(1)
		continue
	for j in range(29,-1,-1):
		if dp[j][r] >= 0 and hs[dp[j][r]] < h[b]:
			f += 2 ** j
			r = dp[j][r]
	if f >= n + 1:
		print(-1)
	else:
		print(f + 1)