#ifdef LOCAL
#include <local.hpp>
#else
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
#include <bits/stdc++.h>
#define debug(...) (static_cast<void>(0))
#define postprocess() (static_cast<void>(0))
#endif

// #include "atcoder/dsu.hpp"
// #include "atcoder/modint.hpp"
// using mint = atcoder::modint998244353;
// using mint = atcoder::modint1000000007;

using namespace std;
using ll = long long;
using ld = long double;

void solve([[maybe_unused]] int test) {
    int N;
    cin >> N;

    vector<pair<int, int>> _H(N);
    for (int i = 0; i < N; i++) {
        cin >> _H[i].first;
        _H[i].second = i;
    }

    sort(_H.begin(), _H.end());
    vector<int> index(N);
    for (int i = 0; i < N; i++) {
        index[_H[i].second] = i;
    }

    vector<int> H(N);
    for (int i = 0; i < N; i++) {
        H[i] = _H[i].first;
    }

    vector<int> T(N);
    for (int i = 0; i < N; i++) {
        cin >> T[index[i]];
    }

    vector<int> uniqueH;
    for (int i = 0; i < N; i++) {
        if (i == 0 || H[i] != H[i - 1]) {
            uniqueH.push_back(H[i]);
        }
    }

    vector<int> next_idx[20];
    for (int i = 0; i < 20; i++) {
        next_idx[i].resize(uniqueH.size());
        for (int j = 0; j < (int)next_idx[i].size(); j++) {
            next_idx[i][j] = j;
        }
    }

    for (int i = 0; i < N; i++) {
        auto itr = upper_bound(uniqueH.begin(), uniqueH.end(), T[i]);

        if (itr == uniqueH.begin()) continue;
        itr--;

        int idx = itr - uniqueH.begin();

        int cur = lower_bound(uniqueH.begin(), uniqueH.end(), H[i]) - uniqueH.begin();

        next_idx[0][cur] = max(next_idx[0][cur], idx);
    }
    for (int i = 0; i + 1 < (int)uniqueH.size(); i++) {
        next_idx[0][i + 1] = max(next_idx[0][i + 1], next_idx[0][i]);
    }

    for (int i = 1; i < 20; i++) {
        for (int j = 0; j < (int)uniqueH.size(); j++) {
            if (next_idx[i - 1][j] != -1) {
                next_idx[i][j] = next_idx[i - 1][next_idx[i - 1][j]];
            }
        }
    }

    debug(next_idx[0]);

    int Q;
    cin >> Q;

    for (int q = 0; q < Q; q++) {
        int x, y;
        cin >> x >> y;
        x--;
        y--;
        x = index[x];
        y = index[y];

        int from = upper_bound(uniqueH.begin(), uniqueH.end(), T[x]) - uniqueH.begin();
        from--;

        if (from == -1) {
            cout << -1 << endl;
            continue;
        }

        int to = lower_bound(uniqueH.begin(), uniqueH.end(), H[y]) - uniqueH.begin();

        bool ok = false;

        int imin = 0;
        int imax = 1000000;

        while (imax - imin > 1) {
            int imid = (imin + imax) / 2;

            int cur = from;
            for (int i = 0; i < 20; i++) {
                if ((imid - 1) & (1 << i)) {
                    cur = next_idx[i][cur];
                }
            }

            if (cur >= to) {
                ok = true;
                imax = imid;
            } else {
                imin = imid;
            }
        }

        cout << (ok ? imax : -1) << endl;
    }
}

int main() {
    ios::sync_with_stdio(false), cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    for (int _t = 1; _t <= t; _t++) solve(_t);

    postprocess();
}