#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];
	auto ch = h;
	sort(all(ch));
	vector<int>idx(n);
	rep(i, n)idx[i] = i;
	sort(all(idx), [&](int i, int j) {return h[i] < h[j]; });
	vector<int>inv(n);
	rep(i, n)inv[idx[i]] = i;
	vector<vector<int>>dp(20, vector<int>(n, -1));
	rep(i, n) {
		int cnt = upper_bound(all(ch), t[idx[i]]) - ch.begin();
		dp[0][i] = cnt - 1;
	}
	rep2(i, 1, 20) {
		segtree<int, op, e>seg(dp[i - 1]);
		rep(j, n) {
			dp[i][j] = dp[i - 1][j];
			if (-1 == dp[i - 1][j])continue;
			chmax(dp[i][j], seg.prod(0, dp[i - 1][j] + 1));
			//chmax(doubling[i][j], doubling[i - 1][doubling[i - 1][j]]);
			//chmax(doubling[i][j], doubling[i - 1][r[]]);
		}
		//break;
	}
	//rep(i, 20)debug(dp[i]);
	int q; cin >> q;
	while (q--) {
		int a, b; cin >> a >> b;
		a--, b--;
		a = inv[a];
		b = inv[b];
		//cout << a << "_" << b << endl;
		//continue;
		if (dp[19][a] < b) {
			cout << -1 << endl;
			continue;
		}
		int ans = 0;
		rrep(i, 20) {
			if (dp[i][a] < b) {
				ans += 1 << i;
				a = dp[i][a];
			}
		}
		ans++;
		cout << ans << endl;
	}
	return 0;
}