#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n; cin >> n;
  vector<int> h(n), t(n);
  REP(i, n) cin >> h[i];
  REP(i, n) cin >> t[i];
  int q; cin >> q;
  vector<int> a(q), b(q); REP(i, q) cin >> a[i] >> b[i], --a[i], --b[i];
  vector<int> v(n * 2);
  ranges::copy(h, v.begin());
  ranges::copy(t, next(v.begin(), n));
  ranges::sort(v);
  v.erase(unique(ALL(v)), v.end());
  REP(i, n) h[i] = distance(v.begin(), ranges::lower_bound(v, h[i]));
  REP(i, n) t[i] = distance(v.begin(), ranges::lower_bound(v, t[i]));
  // REP(i, n) cout << h[i] << " \n"[i + 1 == n];
  // REP(i, n) cout << t[i] << " \n"[i + 1 == n];
  vector<int> ans(q, -1);
  vector<vector<int>> queries(n);
  REP(i, q) {
    if (h[b[i]] <= t[a[i]]) {
      ans[i] = 1;
    } else {
      queries[a[i]].emplace_back(i);
    }
  }
  vector<int> ord(n);
  iota(ALL(ord), 0);
  ranges::sort(ord, {}, [&](const int i) -> pair<int, int> { return {-t[i], h[i]}; });
  vector<int> seq;
  for (const int i : ord) {
    const int p = ssize(seq) - distance(seq.rbegin(), upper_bound(seq.rbegin(), seq.rend(), t[i]));
    if (p < seq.size()) {
      for (const int id : queries[i]) {
        if (t[seq.front()] < h[b[id]]) continue;
        int lb = 0, ub = p + 1;
        while (ub - lb > 1) {
          const int mid = midpoint(lb, ub);
          (h[b[id]] <= t[seq[mid]] ? lb : ub) = mid;
        }
        ans[id] = p - lb + 2;
      }
    } else {
      seq.clear();
    }
    if (h[i] < t[i]) {
      while (seq.size() >= 2 && h[seq.end()[-2]] <= t[i]) seq.pop_back();
      seq.emplace_back(i);
    }
  }
  REP(i, q) cout << ans[i] << '\n';
  return 0;
}