#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
#define debug(v){{rep(_,v.size())cout << v[_] <<" ";}cout<< endl;}
template<typename A, typename B> inline bool chmax(A& a, const B& b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A& a, const B& b) { if (a > b) { a = b; return true; } return false; }
int op(int a, int b) { return max(a, b); }
int e() { return -1; }
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; cin >> n;
	vector<int>h(n), t(n);
	rep(i, n)cin >> h[i];
	rep(i, n)cin >> t[i];
	vector<int> idx(n);
	iota(all(idx), 0);
	sort(all(idx), [&](int i, int j) {return h[i] < h[j]; });
	vector<int>inv(n);
	rep(i, n)inv[idx[i]] = i;
	vector<int> hs(n), ts(n);
	rep(i, n) hs[i] = h[idx[i]], ts[i] = t[idx[i]];
	vector<int> rs(n);
	rep(i, n) rs[i] = upper_bound(all(hs), ts[i]) - hs.begin();
	const int sz = 20;
	vector<vector<int>> dp(sz, vector<int>(n));
	vector<int> rui(n + 1, -1), arg(n + 1, -1);
	rep(i, n) {
		rui[i + 1] = rui[i];
		arg[i + 1] = arg[i];
		if (chmax(rui[i + 1], rs[i])) arg[i + 1] = i;
	}
	rep(i, n) dp[0][i] = arg[rs[i]];
	rep(i, sz - 1) {
		rep(j, n) {
			dp[i + 1][j] = (dp[i][j] == -1 ? -1 : dp[i][dp[i][j]]);
		}
	}
	int q; cin >> q;
	while (q--) {
		int a, b; cin >> a >> b;
		a--, b--;
		a = inv[a], b = inv[b];
		if (b < rs[a]) {
			cout << 1 << endl;
			continue;
		}
		int ans = 0;
		rrep(i, sz) {
			if (-1 == dp[i][a])continue;
			if (b >= rs[dp[i][a]]) {
				ans += 1 << i;
				a = dp[i][a];
			}
		}
		a = dp[0][a];
		cout << (a == -1 ? -1 : b < rs[a] ? ans + 2 : -1) << endl;
	}
	return 0;
}