#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define int long long
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<pii> vii;
typedef vector<bool> vb;
typedef tree<pii,null_type,less<pii>,rb_tree_tag,
tree_order_statistics_node_update> oset;
#define fi first
#define se second
#define pb push_back
#define pf push_front
#define mid (l+r)/2
#define all(x) x.begin(),x.end()
#define FOR(i,a) for(int i=0;i<(a);i++)
#define FORE(i,a,b) for(int i=(a);i<(b);i++)
#define cont(x) for(auto el:x) cout<<el<<' ';cout<<endl;
#define contp(x) for(auto el:x) cout<<el.fi<<'-'<<el.se<<' ';cout<<endl;
#define sp <<" "<<
#define DEBUG(x) cout<<(#x) sp x<<endl
#define carp(a,b) (((a%MOD)*(b%MOD))%MOD)
#define topla(a,b) (((a%MOD)+(b%MOD))%MOD)
const int INF=1e18;
const int MAXN=2e5+5;
const int MOD=998244353;
int n;
vi a,b;
bool mm(pii a,pii b){
return a.se<b.se;
}
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin>>n;
a.resize(n+1);
b.resize(n+1);
vi pref(n+1,0);
FORE(i,1,n+1) cin>>a[i];
FORE(i,1,n+1){
cin>>b[i];
if(i!=1 and a[i-1]>=b[i]){
pref[i]=pref[i-1]+1;
}
else{
pref[i]=pref[i-1];
}
}
int q;
cin>>q;
while(q--){
int l,r;
cin>>l>>r;
if(r-l>=1 and pref[r]-pref[l]<r-l) cout<<"No"<<endl;
else cout<<"Yes"<<endl;
}
}
