#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <limits.h>
#include <set>
#include <string>
#include <queue>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <deque>
#include <map>
#include <chrono>
#include <random>
#include <bitset>
#include <tuple>
#define SZ(x) int(x.size())
#define FR(i,a,b) for(int i=(a);i<(b);++i)
#define FOR(i,n) FR(i,0,n)
#define FAST ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define A first
#define B second
#define mp(a,b) make_pair(a,b)
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
typedef unsigned __int128 U128;
typedef __int128 I128;
typedef std::pair<int,int> PII;
typedef std::pair<LL,LL> PLL;
using namespace std;
const LL MAXN=5e5+5;
LL a[MAXN], b[MAXN];
bool cmp(PLL a, PLL b){
return a.B<b.B;
}
signed main(){
FAST;
LL n; cin>>n;
FR(i,1,n+1) cin>>a[i];
FR(i,1,n+1) cin>>b[i];
LL q; cin>>q;
while (q--){
LL l,r; cin>>l>>r;
LL m=r-l+1;
vector<PLL> v;
v.reserve(m);
set<LL> s;
FR(i,l,r+1){
v.push_back(mp(a[i],b[i]));
s.insert(b[i]);
}
sort(v.begin(),v.end(),cmp);
bool can=true;
FOR(i,m){
LL x=v[i].A, y=v[i].B;
auto it=s.upper_bound(x);
if (it==s.begin()) can=false;
it--;
if (*it==y){
if (it==s.begin()) can=false;
else it--;
}
if (!can) break;
s.erase(it);
}
if (can) cout<<"Yes\n";
else cout<<"No\n";
}
return 0;
}
