/* 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;
for(int j = l; j <= r; ++j) v.pb(a[j]);
sort(all(v), [&](const array<int, 2>&x, const array<int, 2>&y){
return pii{x[1],x[0]}<pii{y[1],y[0]};
});
vi dp(v.size()+1);
dp.back()=1;
for(int j=int(v.size())-1; j>=0;--j){
for(int k=j+1; k<v.size();++k){
if(v[j][0] > v[k][1]){
dp[j]=dp[j]|dp[k+1];
}
}
}
if(dp[0]) 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;
}
