#include <iostream>
#include <vector>
#include <string>
#include <math.h>
#include <cmath>
#include <iomanip>
#include <cstdio>
#include <algorithm>
#include <numeric>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <deque>
#include <bitset>
#include <cstring>
#include <unordered_map>
#include <unistd.h>

using namespace std;
typedef long long ll;

vector<string> word = {"hello", "hiya", "hi", "hey", "heeey"};

void blank(ll p){
    for(int i = 0; i < p; i++)
        cout << ' ';
}
void solve(ll k){
    ll p = rand() % 100;
    
    blank(p);
    for(int i = 0; i < k + 2; i++)
        cout << '-';
    cout << endl;
    for(int i = 0; i < k; i++){
        blank(p);
        cout << '|';
//        string s = "ffffffffffffffffff";
//        while(s.size() > k)
//            s = word[rand() % word.size()];
//        
//        cout << s;
        for(int j = 0; j < k; j++)
            cout << ' ';
        cout << '|';
        cout << endl;
    }
    blank(p);
    for(int i = 0; i < k + 2; i++)
        cout << '-';
    cout << endl;
}

ll prev0 = 50;

void distr(){
    prev0 = (rand() % 2 ? -1 : 1) + prev0;
    blank(prev0);
    cout << '*' << endl;
}

int main(){
    srand(time(0));
    ll n;
    cin >> n;
    
    vector<pair<ll, ll>> a(n);
    for(auto &i: a)
        cin >> i.first;
    for(auto &i: a)
        cin >> i.second;
    
    bool test56 = false;
    for(int i = 0; i < n - 1; i++)
        if(a[i] > a[i + 1])
            test56 = true;
    
    if(!test56){
        vector<ll> dist(n);
        ll ind = n;
        
        for(int i = n - 1; i >= 0; i--){
            while(ind - 1 >= 0 && a[ind - 1].first > a[i].second)
                ind--;
            
            dist[i] = ind;
        }
        vector<ll> pref(n);
        for(int i = 1; i < n; i++)
            pref[i] = pref[i - 1] + (dist[i] == i);
        
        ll q;
        cin >> q;
        
        while(q--){
            ll l, r;
            cin >> l >> r;
            
            l--, r--;
            
            ll sum = pref[r] - pref[l];
            
            cout << (sum == 0 ? "Yes" : "No") << endl;
        }
        
        return 0;
    }
    
    ll q;
    cin >> q;
    
    vector<ll> a_to_b(2 * n + 1);
    for(int i = 0; i < n; i++)
        a_to_b[a[i].first] = a[i].second;
    
    while(q--){
        ll l, r;
        cin >> l >> r;
        
        l--, r--;
        
        vector<ll>a0, b;
        for(int i = l; i <= r; i++){
            a0.push_back(a[i].first);
            b.push_back(a[i].second);
        }
        sort(a0.begin(), a0.end());
        sort(b.begin(), b.end());
        vector<ll> dist(r - l + 3);
        dist[b.size()] = b.size();
        
        bool ok = false;
        ll ind = a0.size();
        
        for(int i = b.size() - 1; i >= 0; i--){
            while(ind - 1 >= 0 && a0[ind - 1] > b[i])
                ind--;
            
            dist[i] = ind;
            
            if(dist[i + 1] == i + 1 && dist[i] == i){
                ok = true;
                break;
            }
        }
        
        cout << (ok ? "No" : "Yes") << endl;
    }
    
    return 0;
}
/*
 10
 2 5 8 10 12 14 16 17 19 20
 1 4 7 6 11 13 9 3 18 15
 1
 5 8
 */
// 12 14 16 17
// 11 13 9 3
/*
 4
 3 8 5 7
 2 6 1 4
 1
 3 4
 
 */