import typing


def _ceil_pow2(n: int) -> int:
    x = 0
    while (1 << x) < n:
        x += 1

    return x


class SegTree:
    def __init__(self,
                 op: typing.Callable[[typing.Any, typing.Any], typing.Any],
                 e: typing.Any,
                 v: typing.Union[int, typing.List[typing.Any]]) -> None:
        self._op = op
        self._e = e

        if isinstance(v, int):
            v = [e] * v

        self._n = len(v)
        self._log = _ceil_pow2(self._n)
        self._size = 1 << self._log
        self._d = [e] * (2 * self._size)

        for i in range(self._n):
            self._d[self._size + i] = v[i]
        for i in range(self._size - 1, 0, -1):
            self._update(i)

    def set(self, p: int, x: typing.Any) -> None:
        assert 0 <= p < self._n

        p += self._size
        self._d[p] = x
        for i in range(1, self._log + 1):
            self._update(p >> i)

    def get(self, p: int) -> typing.Any:
        assert 0 <= p < self._n

        return self._d[p + self._size]

    def prod(self, left: int, right: int) -> typing.Any:
        assert 0 <= left <= right <= self._n
        sml = self._e
        smr = self._e
        left += self._size
        right += self._size

        while left < right:
            if left & 1:
                sml = self._op(sml, self._d[left])
                left += 1
            if right & 1:
                right -= 1
                smr = self._op(self._d[right], smr)
            left >>= 1
            right >>= 1

        return self._op(sml, smr)

    def all_prod(self) -> typing.Any:
        return self._d[1]

    def max_right(self, left: int,
                  f: typing.Callable[[typing.Any], bool]) -> int:
        assert 0 <= left <= self._n
        assert f(self._e)

        if left == self._n:
            return self._n

        left += self._size
        sm = self._e

        first = True
        while first or (left & -left) != left:
            first = False
            while left % 2 == 0:
                left >>= 1
            if not f(self._op(sm, self._d[left])):
                while left < self._size:
                    left *= 2
                    if f(self._op(sm, self._d[left])):
                        sm = self._op(sm, self._d[left])
                        left += 1
                return left - self._size
            sm = self._op(sm, self._d[left])
            left += 1

        return self._n

    def min_left(self, right: int,
                 f: typing.Callable[[typing.Any], bool]) -> int:
        assert 0 <= right <= self._n
        assert f(self._e)

        if right == 0:
            return 0

        right += self._size
        sm = self._e

        first = True
        while first or (right & -right) != right:
            first = False
            right -= 1
            while right > 1 and right % 2:
                right >>= 1
            if not f(self._op(self._d[right], sm)):
                while right < self._size:
                    right = 2 * right + 1
                    if f(self._op(self._d[right], sm)):
                        sm = self._op(self._d[right], sm)
                        right -= 1
                return right + 1 - self._size
            sm = self._op(self._d[right], sm)

        return 0

    def _update(self, k: int) -> None:
        self._d[k] = self._op(self._d[2 * k], self._d[2 * k + 1])


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


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()

segt = SegTree(max, (0, 0), [(t, i) for _, t, i in cities])
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)
        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)