import os,sys,random,threading
#sys.exit() 退出程序
from random import randint,choice,shuffle
#randint(a,b)从[a,b]范围随机选择一个数
#choice(seq)seq可以是一个列表,元组或字符串,从seq中随机选取一个元素
#shuffle(x)将一个可变的序列x中的元素打乱
from copy import deepcopy
from io import BytesIO,IOBase
from types import GeneratorType
from functools import lru_cache,reduce
#reduce(op,迭代对象)
from bisect import bisect_left,bisect_right
#bisect_left(x) 大于等于x的第一个下标
#bisect_right(x) 大于x的第一个下标
from collections import Counter,defaultdict,deque
from itertools import accumulate,combinations,permutations
#accumulate(a)用a序列生成一个累积迭代器，一般list化前面放个[0]做前缀和用
#combinations(a,k)a序列选k个 组合迭代器
#permutations(a,k)a序列选k个 排列迭代器
from heapq import  heapify,heappop,heappush
#heapify将列表转为堆
from typing import Generic,Iterable,Iterator,TypeVar,Union,List
from string import ascii_lowercase,ascii_uppercase,digits
#小写字母，大写字母，十进制数字
from math import ceil,floor,sqrt,pi,factorial,gcd,log,log10,log2,inf
#ceil向上取整，floor向下取整 ，sqrt开方 ，factorial阶乘
from decimal import Decimal,getcontext
#Decimal(s) 实例化Decimal对象,一般使用字符串
#getcontext().prec=100 修改精度
from sys import stdin, stdout, setrecursionlimit
input = lambda: sys.stdin.readline().rstrip("\r\n")
MI = lambda :map(int,input().split())
li = lambda :list(MI())
ii = lambda :int(input())
mod = int(1e9 + 7) #998244353
inf = int(1e20)
py = lambda :print("YES")
pn = lambda :print("NO")
DIRS = [(0, 1), (1, 0), (0, -1), (-1, 0)]  # 右下左上
DIRS8 = [(0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1), (-1, 0),(-1, 1)]  # →↘↓↙←↖↑↗



n=ii()

h=[0]+li()
t=[0]+li()

tmp=list(range(1,n+1))

tmp.sort(key=lambda x:t[x])

tmp2=list(range(1,n+1))

tmp2.sort(key=lambda x:-h[x])

pre=0

dp=[[0]*20 for _ in range(n+1)]

for i in tmp:
    while tmp2 and h[tmp2[-1]]<=t[i]:
        x=tmp2.pop()
        if t[x]>t[pre]:
            pre=x
    if t[pre]>t[i]:
        dp[i][0]=pre
    else:
        dp[i][0]=i
    #print(i,tmp2,pre)

for i in range(1,20):
    for j in range(1,n+1):
        dp[j][i]=dp[dp[j][i-1]][i-1]

q=ii()

#print(dp)

for _ in range(q):
    a,b=li()
    if t[a]>=h[b]:
        print(1)
    else:
        res=0
        node=a
        for i in range(19,-1,-1):
            if t[dp[node][i]]<h[b]:
                res+=1<<i
                node=dp[node][i]
        if res>n:
            print(-1)
        else:
            print(res+2)