#include <bits/stdc++.h>

using namespace std;
#define SZ(x) (int) (x).size()
#define REP(i, n) for(int i = 0; i < (n); i++)
#define FOR(i, a, b) for(auto i = (a); i < (b); i++)
#define For(i, a, b, c) \
	for(auto i = (a); i != (b); i += (c))
#define REPR(i, n) for(auto i = (n) -1; i >= 0; i--)
#define ALL(s) (s).begin(), (s).end()
#define so(V) sort(ALL(V))
#define rev(V) reverse(ALL(V))
#define uni(v) v.erase(unique(ALL(v)), (v).end())
#define eb emplace_back

typedef unsigned long long ull;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<bool> vb;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef pair<int, int> PI;
typedef pair<ll, ll> PL;
const double EPS = 1e-6;
const int MOD = 1e9 + 7;
const int INF = (1 << 30);
const ll LINF = 1e18;
const double math_PI = acos(-1);

template<typename T>
vector<T> make_v(size_t a) {
	return vector<T>(a);
}

template<typename T, typename... Ts>
auto make_v(size_t a, Ts... ts) {
	return vector<decltype(make_v<T>(ts...))>(
		a, make_v<T>(ts...));
}

template<typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(
	T& t, const V& v) {
	t = v;
}

template<typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(
	T& t, const V& v) {
	for(auto& e: t) fill_v(e, v);
}

template<class T>
bool chmax(T& a, const T& b) {
	if(a < b) {
		a = b;
		return true;
	}
	return false;
}

template<class T>
bool chmin(T& a, const T& b) {
	if(a > b) {
		a = b;
		return true;
	}
	return false;
}

template<typename S, typename T>
istream& operator>>(istream& is, pair<S, T>& p) {
	cin >> p.first >> p.second;
	return is;
}

template<typename T>
istream& operator>>(istream& is, vector<T>& vec) {
	for(T& x: vec) is >> x;
	return is;
}

template<typename T>
string join(vector<T>& vec, string splitter) {
	stringstream ss;
	REP(i, SZ(vec)) {
		if(i != 0) ss << splitter;
		ss << vec[i];
	}
	return ss.str();
}

template<typename T>
ostream& operator<<(ostream& os, vector<T>& vec) {
	os << join(vec, " ");
	return os;
}
template<class T = ll>
struct Edge {
public:
	int from, to;
	T cost;
	Edge() {
	}
	Edge(int _from, int _to, T _cost) {
		from = _from;
		to = _to;
		cost = _cost;
	}
};
template<class T = ll>
using Edges = vector<Edge<T>>;
template<class T = ll>
using Graph = vector<Edges<T>>;
/// @brief 蜊倅ｸ€蟋狗せ譛€遏ｭ邨瑚ｷｯ髟ｷ蝠城｡後ｒ隗｣縺・/// @param s 蟋狗せ
/// @param G 繧ｰ繝ｩ繝・/// @return ret[i]:s縺九ｉi縺ｸ縺ｮ譛€遏ｭ邨瑚ｷｯ髟ｷ
vll dijkstra(int s, Graph<ll>& G) {
	using P = pair<ll, int>;
	priority_queue<P, vector<P>, greater<>> que;
	vll D(SZ(G), LINF);
	D[s] = 0;
	que.push(P(0, s));
	while(!que.empty()) {
		P p = que.top();
		que.pop();
		int v = p.second;
		if(D[v] < p.first) continue;
		for(Edge e: G[v]) {
			if(D[e.to] > D[v] + e.cost) {
				D[e.to] = D[v] + e.cost;
				que.push(P(D[e.to], e.to));
			}
		}
	}
	return D;
}

int main() {
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	int N;
	cin >> N;
	vi H(N);
	cin >> H;
	priority_queue<PI, vector<PI>, greater<>> C;
	vector<PI> V;
	REP(i, N) {
		C.emplace(H[i], i);
		V.eb(H[i], i);
	}
	so(V);
	vi T(N);
	cin >> T;
	int Q;
	cin >> Q;
	int limit = -1;
	vi stage(N);
	set<int> wall;
	int stageId = 0;
	while(!C.empty()) {
		if(limit < C.top().first) {
			limit = C.top().first;
			wall.insert(stageId);
		}
		int next_limit = limit;
		while(!C.empty() && C.top().first <= limit) {
			auto [h, i] = C.top();
			C.pop();
			chmax(next_limit, T[i]);
			stage[i] = stageId;
		}
		limit = next_limit;
		stageId++;
	}
	REP(i, Q) {
		int A, B;
		cin >> A >> B;
		A--;
		B--;
		if(T[A] >= H[B]) {
			cout << 1 << endl;
			continue;
		}
		int ans = 1;
		auto it = lower_bound(ALL(V), PI { T[A], N });
		if(it == V.begin()) {
			cout << -1 << endl;
			continue;
		}
		it = prev(it);
		auto [h, j] = *it;
		int initial_stage = stage[j];
		int goal_stage = stage[B];
		if(*wall.upper_bound(initial_stage) <= goal_stage) {
			cout << -1 << endl;
			continue;
		}
		ans += max(0, goal_stage - initial_stage);
		chmax(ans, 2);
		cout << ans << endl;
	}
	return 0;
}