#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N = 2e5 + 10;
const ll MOD = 1e9 + 7;

bool ans = true;
void mergeSort(vector<ll> &v, ll low, ll high) {
  if(low >= high) return;
  ll mid = low + (high - low) / 2;
  ans &= (v[mid] <= v[mid + 1]);
  if(ans) mergeSort(v, low, mid);
  if(ans) mergeSort(v, mid + 1, high);
}

void solve()
{
  ll n;
  cin >> n;
  
  vector<ll> v(n);
  for(ll i = 0; i < n; i++) {
    cin >> v[i];
  }
  
  ll q;
  cin >> q;
  while(q--) {
    ll type, a, b;
    cin >> type >> a >> b;
    a--, b--;
    if(type == 1) v[a] = b + 1;
    else {
      ans = true;
      mergeSort(v, a, b);
      if(ans) cout << "YES" << "\n";
      else cout << "NO" << "\n";
    }
  }
}

int main()
{
  ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
  solve();
}