/* Author : Mychecksdead */
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define pb push_back
#define all(x) x.begin(), x.end()
#define en cout << '\n'
#define ff first
#define ss second
#define pii pair<int,int>
#define vi vector<int>
const int N = 1e6+100, M = 1e5+10, K = 52, MX = 30;
int n, q;
array<int, 2> a[N];
void solve(){
cin>> n;
for(int i = 1; i <= n; ++i){
cin >> a[i][0];
}
for(int i = 1; i <= n; ++i){
cin >> a[i][1];
}
cin >> q;
for(;q--;){
int l, r; cin >> l >> r;
vector<array<int, 2>> v, p;
for(int j = l; j <= r; ++j) v.pb(a[j]);
sort(all(v));
for(int j=0;j<r-l+1;++j) p.pb({-v[j][1], j});
sort(all(p));
set<int> s;
bool ok = 1;
for(int j=0;j<v.size();++j){s.insert(j);}
for(int j=0;j<v.size();++j){
int i = p[j][1];
int pos = lower_bound(all(v), array<int, 2>{v[i][1], -1}) - v.begin();
auto it = s.lower_bound(pos);
if(it == s.end()){
ok = 0;
break;
}
if((*it)==i){
++it;
}
if(it == s.end()){
ok = 0;
break;
}
s.erase(it);
}
if(ok) cout << "Yes\n";
else cout << "No\n";
}
}
int main(){
cin.tie(0); ios::sync_with_stdio(0);
int tt = 1, aa;
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
while(tt--){
solve();
}
cerr<<"time taken : "<<(float)clock()/CLOCKS_PER_SEC<<" seconds\n";
return 0;
}
