#include<bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using mint=modint998244353; //1000000007;
using ll=long long;
using pp=pair<int,int>;
#define sr string 
#define vc vector
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define pb push_back
#define all(v) v.begin(),v.end()
#define pque priority_queue
#define bpc(a) __builtin_popcount(a)
int main(){
  int n;cin>>n;
  vc<pair<int,pp>>hh(n); rep(i,n)cin>>hh[i].fi; rep(i,n)cin>>hh[i].se.fi;
  rep(i,n)hh[i].se.se=i; sort(all(hh));
  vc<int>h(n),t(n); rep(i,n)h[i]=hh[i].fi,t[i]=hh[i].se.fi;
  vc<int>r(n); rep(i,n)r[hh[i].se.se]=i;
  vc<int>rr(n); rep(i,n)rr[i]=hh[i].se.se;
  vc<int>v(n);
  rep(i,n){
    int it=upper_bound(all(h),t[i])-h.begin();
    it--;
    v[i]=it;
  }
  vc vx(20,vc<int>(n)); vx[0]=v;
  rep(i,n-1)vx[0][i+1]=max(vx[0][i+1],vx[0][i]);
  rep(i,19)rep(j,n)if(vx[i][j]!=-1)vx[i+1][j]=vx[i][vx[i][j]];
  int q;cin>>q;
  rep(z,q){
    int a,b;cin>>a>>b; a--;b--;
    a=r[a],b=r[b];
    if(v[a]==-1){
      cout<<-1<<"\n";
      continue;
    }
    if(b<=v[a]){
      cout<<1<<"\n";
      continue;
    }
    a=v[a];
    if(b>vx[19][a]){
      cout<<-1<<"\n";
      continue;
    }
    int res=0;
    for(int i=19;i>=0;i--){
      int na=vx[i][a];
      if(na<b){
        res+=1<<i;
        a=na;
      }
    }
    cout<<res+2<<"\n";
  }
}