#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long int
#define vv vector<long long>
#define mpp map<long long,long long>
#define ss set<long long>
#define vp vector<pair<long long, long long>>
#define MOD 1000000007
#define YES cout<<"YES"<<endl
#define NO cout<<"NO"<<endl
#define all_v v.begin(),v.end()
#define all_a a.begin(),a.end()
#define sort_rev sort(v.rbegin(),v.rend());
#define all_n for(int i=0;i<n;i++)
#define print for(auto it:v)cout<<it<<" "
#define print_vp for(auto it:vp)cout<<it.first<<" "<<it.second<<endl
#define print_mp for(auto it:mp) cout<<it.first<<" "<<it.second<<endl
void requisite(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);cout.tie(nullptr);
}
int main() {
    requisite();
        ll n,q;
        cin>>n;
        vv v(n);
        all_n {
            cin >> v[i];
        }
        cin>>q;
        for (int i = 0; i < q; ++i) {
            ll a,b,c;
            cin>>a>>b>>c;
            if (a==2){
                if (is_sorted(v.begin()+b-1,v.begin()+c-1)){
                    YES;
                }
                else NO;
            }
            else if (a==1){
                if (b==v.size()){
                    v.push_back(c);
                }
                else
                v[b-1]=c;
            }
        }
    return 0;
}