#include <bits/stdc++.h>
#include <experimental/random>
#include <random>
//#include <ext/pb_ds/assoc_container.hpp>
//using namespace __gnu_pbds;
using namespace std;
using ld = long double;
using ll = long long;
const ll INF = 3e18, MOD = 1e9 + 7;
void solve();
signed main() {
#ifdef LOCAL
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios::sync_with_stdio(false);
cin.tie(0);
int q = 1;
//cin >> q;
while (q--) {
solve();
}
}
void solve() {
ll n; cin >> n;
vector<pair<ll, ll>> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i].second;
}
for (int i = 0; i < n; i++) {
cin >> a[i].first;
}
ll q; cin >> q;
while (q--) {
ll l, r; cin >> l >> r;
l--, r--;
vector<pair<ll, ll>> b;
for (ll i = l; i <= r; i++) {
b.push_back(a[i]);
}
sort(b.rbegin(), b.rend());
ll mx = -INF; bool flag = true;
for (int i = (int)b.size() - 1; i >= 0; i--) {
if (mx >= b[i].first || (i != 0 && b[i - 1].first <= b[i].second)) {
mx = max(mx, b[i].second);
} else {
flag = false;
break;
}
}
if (flag) {
cout << "Yes\n";
} else {
cout << "No\n";
}
}
}
