#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <bitset>
#include <fstream>
#include <array>
#include <functional>
#include <stack>
#include <memory>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define x first
#define y second
#define Time (double)clock()/CLOCKS_PER_SEC

#ifdef LOCAL
#define debug(x) std::cerr << #x << ": " << x << '\n';
#define debug2(x, y) std::cerr << #x << ", " << #y << ": " << x << ", " << y << '\n';
#define debug3(x, y, z) std::cerr << #x << ", " << #y << ", " << #z << ": " << x << ", " << y << ", " << z << '\n';
#else
#define debug(x)
#define debug2(x, y) 
#define debug3(x, y, z) 
#endif

#define FORI(i,a,b) for (int i = (a); i < (b); ++i)
#define FOR(i,a) FORI(i,0,a)
#define ROFI(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define ROF(i,a) ROFI(i,0,a)
#define rep(a) FOR(_,a)
#define each(a,x) for (auto& a: x)
#define FORN(i, n) FORI(i, 1, n + 1)

using vi = vector<int>;
template <typename T>
std::istream& operator >>(std::istream& input, std::pair <T, T> & data)
{
    input >> data.x >> data.y;
    return input;
}
template <typename T>
std::istream& operator >>(std::istream& input, std::vector<T>& data)
{
    for (T& x : data)
        input >> x;
    return input;
}
template <typename T>
std::ostream& operator <<(std::ostream& output, const pair <T, T> & data)
{
    output << "(" << data.x << "," << data.y << ")";
    return output;
}
template <typename T>
std::ostream& operator <<(std::ostream& output, const std::vector<T>& data)
{
    for (const T& x : data)
        output << x << " ";
    return output;
}
ll div_up(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up
ll div_down(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down 
ll math_mod(ll a, ll b) { return a - b * div_down(a, b); }
#define tcT template<class T
#define tcTU tcT, class U
tcT> using V = vector<T>; 
tcT> bool ckmin(T& a, const T& b) {
    return b < a ? a = b, 1 : 0; 
} // set a = min(a,b)
tcT> bool ckmax(T& a, const T& b) {
    return a < b ? a = b, 1 : 0; 
}
ll gcd(ll a, ll b) {
    while (b) {
        tie(a, b) = mp(b, a % b);
    }
    return a;
}
int Bit(int mask, int bit) { return (mask >> bit) & 1; }
signed main() {
    #ifdef LOCAL
    #else
    #define endl '\n'
    ios_base::sync_with_stdio(0); cin.tie(0);
    #endif
    int n;
    cin >> n;
    vi h(n), t(n);
    cin >> h >> t;
    int q;
    cin >> q;
    const int LG = 20;
    V <map <int, int> > mx(LG);

    FOR(i,n) {
        mx[0][t[i]] = t[i];
    }
    for (int p = 1; p < LG; ++p) {
        V <array <int, 3>> ord;
        FOR(j,n) {
            ord.app({h[j],0,mx[p-1][t[j]]});
        }
        each (e, mx[p - 1]) {
            ord.app({e.y, 1, e.x});
        }
        sort(all(ord));
        /*
        each(e,ord) {
            cout << e[0] << ' ' << e[1] << ' ' << e[2] << endl;
        }
        cout << endl;
        */
        int cur = -1e18;
        each (e,ord) {
            if (e[1]==0) {
                ckmax(cur, e[2]);
            }
            else {
                mx[p][e[2]] = cur;
            }
        }
    }

    rep (q) {
        int a, b;
        cin >> a >> b;
        a--; b--;
        if (t[a]>=h[b]) {
            cout << 1 << endl;
        }
        else {
            a = t[a];
            debug(mx[LG-1][a]);
            debug(a);
            int ans = 0;
            if (mx[LG-1][a]<h[b]) {
                cout<<-1<<endl;
                continue;
            }
            ROF (i, LG) {
                if (mx[i][a] < h[b]) {
                    a = mx[i][a];
                    ans += 1 << i;
                }
            }
            cout<<ans+1<<endl;
        }
    }
}