#include<bits/stdc++.h>
//#include<bits/extc++.h>
using namespace std;
//using namespace __gnu_pbds;
#define S second
#define F first
#define ll long long
//#pragma GCC optimize("Ofast, unroll-loop")
//#pragma GCC target("avx,avx2")
#pragma GCC optimize("O3")
const int inf=0x3f3f3f3f;
const ll inff=0x3f3f3f3f3f3f3f3f;
const int X=1000000007;
int a[200005], b[200005];
signed main(){
ios::sync_with_stdio(false), cin.tie(nullptr);
int n; cin >> n;
for(int i=1 ; i<=n ; i++) cin >> a[i];
for(int i=1 ; i<=n ; i++) cin >> b[i];
int q; cin >> q;
if(q>10) return 0;
while(q--){
bool ok=1;
int l, r; cin >> l >> r;
vector<pair<int,int>> v;
for(int i=l ; i<=r ; i++) v.push_back({a[i],b[i]});
sort(v.begin(),v.end());
deque<pair<int,int>> dq; //h, pos
for(int i=0 ; i<v.size() ; i++){
auto[ai,bi]=v[i];
while(!dq.empty()&&dq.back().F>bi) dq.pop_back();
dq.push_back({bi,i});
}
int cur=0;
while(cur<v.size()){
if(dq.size()==0){
ok=0;
break;
}
while(dq.size()>=2&&dq[1].F<v[cur].F) dq.pop_front();
if(dq[0].S<=cur){
ok=0;
break;
}
cur=dq[0].S+1;
dq.pop_front();
}
cout << (ok ? "Yes\n" : "No\n");
}
return 0;
}
