#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ALL(x) (x).begin(), (x).end()
#ifdef LOCAL
#include "debug.hpp"
#else
#define debug(...) void(0)
#endif

template <typename T> istream& operator>>(istream& is, vector<T>& v) {
    for (T& x : v) is >> x;
    return is;
}
template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) {
    for (size_t i = 0; i < v.size(); i++) {
        os << v[i] << (i + 1 == v.size() ? "" : " ");
    }
    return os;
}

template <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; }
template <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; }

int topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }
int topbit(long long t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }
int botbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); }
int botbit(long long a) { return a == 0 ? 64 : __builtin_ctzll(a); }
int popcount(signed t) { return __builtin_popcount(t); }
int popcount(long long t) { return __builtin_popcountll(t); }
bool ispow2(int i) { return i && (i & -i) == i; }
long long MSK(int n) { return (1LL << n) - 1; }

template <class T> T ceil(T x, T y) {
    assert(y >= 1);
    return (x > 0 ? (x + y - 1) / y : x / y);
}
template <class T> T floor(T x, T y) {
    assert(y >= 1);
    return (x > 0 ? x / y : (x - y + 1) / y);
}

template <class T1, class T2> inline bool chmin(T1& a, T2 b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T1, class T2> inline bool chmax(T1& a, T2 b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template <typename T> void mkuni(vector<T>& v) {
    sort(v.begin(), v.end());
    v.erase(unique(v.begin(), v.end()), v.end());
}
template <typename T> int lwb(const vector<T>& v, const T& x) { return lower_bound(v.begin(), v.end(), x) - v.begin(); }

const int INF = (1 << 30) - 1;
const long long IINF = (1LL << 60) - 1;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const int MOD = 998244353;
// const int MOD = 1000000007;

#include "atcoder/segtree"

struct S {
    int val, idx;
    S(int val, int idx) : val(val), idx(idx) {}
};

S op(S l, S r) { return l.val >= r.val ? l : r; }

S e() { return S(-1, -1); }

const int MAX_LOG = 20;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N;
    cin >> N;
    vector<int> H(N), T(N);
    cin >> H >> T;

    vector<int> cand;
    for (int& x : H) cand.emplace_back(x);
    for (int& x : T) cand.emplace_back(x);
    mkuni(cand);
    int sz = cand.size();
    vector<S> init(sz, e());
    for (int i = 0; i < N; i++) {
        H[i] = lwb(cand, H[i]);
        T[i] = lwb(cand, T[i]);
        if (init[H[i]].val < T[i]) init[H[i]] = S(T[i], i);
    }
    atcoder::segtree<S, op, e> seg(init);
    vector<vector<int>> doubling(MAX_LOG + 1, vector<int>(N, -1));
    for (int i = 0; i < N; i++) {
        auto res = seg.prod(0, T[i] + 1);
        doubling[0][i] = res.idx;
    }
    for (int i = 0; i < MAX_LOG; i++) {
        for (int j = 0; j < N; j++) {
            int to = doubling[i][j];
            if (to != -1) doubling[i + 1][j] = doubling[i][to];
        }
    }

    auto query = [&](int A, int B) {
        int target = H[B];
        if (doubling[MAX_LOG][A] == -1 or T[doubling[MAX_LOG][A]] < target) return -1;
        int res = 0;
        for (int i = MAX_LOG - 1; i >= 0; i--) {
            int nA = doubling[i][A];
            if (T[nA] < target) {
                res |= 1 << i;
                A = nA;
            }
        }
        if (T[A] < target) res++;
        res++;
        return res;
    };

    int Q;
    cin >> Q;
    for (; Q--;) {
        int A, B;
        cin >> A >> B;
        cout << query(--A, --B) << '\n';
    }
    return 0;
}