#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define fst first
#define snd second
#define pb push_back
#define SZ(x) (int)x.size()
#define ALL(x) x.begin(),x.end()
#define forn(i,a,b) for(int i = a; i<b; i++)
#define mset(a,v) memset(a,v,sizeof(a))
#define FIN ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
template< typename T >
using iset = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
int main(){
ll n; cin>>n;
vector<ll> a(n); forn(i,0,n) cin>>a[i];
vector<ll> b(n); forn(i,0,n) cin>>b[i];
ll q; cin>>q;
forn(iqq,0,q){
ll l,r; cin>>l>>r; l--; r--;
set<pair<ll,ll>> disp;
forn(i,l,r+1){
disp.insert({b[i],i});
}
vector<pair<pair<ll,ll>,ll>> as;
forn(i,l,r+1){
as.pb({{b[i],a[i]},i});
}
sort(ALL(as));
//cout<<"Llega\n";
bool yes = true;
forn(i,0,SZ(as)){
bool erased = false;
auto itf = disp.find({b[as[i].snd],as[i].snd});
if(itf!=disp.end()){
erased=true;
disp.erase(itf);
}
if(SZ(disp)==0){
yes=false;
break;
}
auto it = disp.lower_bound({as[i].fst.snd,-1}); if(it==disp.end()) it--;
if((*it).fst>as[i].fst.snd && it!=disp.begin()){
it--;
}
if((*it).fst>as[i].fst.snd){
yes=false;
break;
}else{
//cout<<as[i].snd<<" to "<<(*it).snd<<'\n';
disp.erase(it);
}
if(erased){
disp.insert({b[as[i].snd],as[i].snd});
}
}
if(yes) cout<<"Yes\n";
else cout<<"No\n";
}
return 0;
}
