#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];
vector<ll> bads; forn(i,1,n){
if(b[i]>a[i-1] && (i+1==n||b[i+1]>a[i])) bads.pb(i);
}
ll q; cin>>q;
forn(iqq,0,q){
ll l,r; cin>>l>>r; l--; r--;
bool yes = true;
ll i = lower_bound(ALL(bads),l)-bads.begin();
if(i!=SZ(bads) && bads[i]<=r){
yes=false;
}
if(b[r]>a[r-1]){
yes=false;
}
if(a[l]<b[l+1]){
yes=false;
}
if(yes) cout<<"Yes\n";
else cout<<"No\n";
}
return 0;
}
