#include<bits/stdc++.h>
using namespace std;

#define print(a) for(auto x:a)cout<<x<<' ';cout<<'\n';
#define debug(x) cout<<#x<<" "<<x<<'\n'
#define int   long long int

const int M = 1e9 + 7;
const int N = 2e5 + 10;

int a[N];

struct node {
    int mn,s,mx,lz, s1;
    node(){
        s1 = s = 0, lz = -1;
    }
};

struct ST {
    vector<node> t;  
    int n;
    ST(int _n){
        n = _n; t.assign(4*n + 10, node());
    }

    node Merge(node a, node b){
        node res;
        res.s1 = a.s1 + b.s1;
        return res;
    }

    void upd(int L,int x,int i,int l,int r) {
        if(l==r) {
            t[i].s = x;
            a[L] = x;
           
           // for(int j = 0; j < 6; j++)cout << a[j] <<' ';cout << '\n';
            if((L > 0 && a[L-1] > a[L]) || (L + 1 < n && a[L] > a[L+1])){
               
               t[i].s1 = 1;
            }else{
               t[i].s1 = 0;
            }
            return;
        }
        int m = (l+r)/2;
        if(L <= m) upd(L, x, 2*i, l, m);
        else upd(L, x, 2*i+1, m+1, r);
        t[i] = Merge(t[2*i], t[2*i+1]);
    }
    void upd(int l, int val){
        upd(l,val,1,0,n-1);
    }

    node qry(int L,int R,int i,int l,int r) {
        if(l >= L && r <= R) return t[i];
        if(l > R || r < L)return node();
        int m=(l+r)/2;

        node left , right;
        if(L <= m)left = qry(L, R, 2*i, l, m);
        if(m < R)right = qry(L, R, 2*i+1, m+1, r);
        return Merge(left, right);
    }
    node qry(int l, int r){
        return qry(l,r,1,0,n-1);
    }  
};

void solve(){
   int n; cin >> n;
   
   for(int i = 0; i < n; i++){
      cin >> a[i];
   }
  

   ST st(n);
   for(int i = 0; i < n; i++){
      st.upd(i, a[i]);
   }

   int q; cin >> q;
   while(q--){
      int x, l, r;
      cin >> x >> l >> r;
      if(x == 1){
         l--;
         st.upd(l, r);
         a[l] = r;
      }else{
         l--, r--;
         if(st.qry(l,r).s1 > 0)cout << "NO\n";
         else cout << "YES\n";
        
      }
   }
}

signed main() {
   ios_base::sync_with_stdio (0);
   cin.tie (0);

   int t = 1;   //cin >> t;
   for (int tc = 1; tc <= t; tc++) {
      //cout<<"Case "<<tc<<": ";
      solve();
   }
   return 0;
}