#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include "temp.cpp"
#include <cstdio>
using namespace std;
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
#define sz(x) (int((x).size()))
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) (x).clear()
#define uniq(x) x.resize(unique(all(x)) - x.begin());
#define blt(x) __builtin_popcount(x)
#define pb push_back
#define popf pop_front
#define popb pop_back
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(deque <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'
// for grid problems
int dx[8] = {-1,0,1,0,1,-1,1,-1};
int dy[8] = {0,1,0,-1,1,1,-1,-1};
// lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
void fastIO() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr); cout.tie(nullptr);
}
// file in/out
void setIO(string str = "") {
fastIO();
if (str != "") {
freopen((str + ".in").c_str(), "r", stdin);
freopen((str + ".out").c_str(), "w", stdout);
}
}
// Indexed Set
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const int N = 1e5 + 10, M = 2e5 + 10;
int a[N], n, q, ok[N], b[N];
long long p[N];
vector<int> indices[M];
void solve_() {
cin >> n;
vector<int> vals;
for(int i = 1; i <= n; i++) {
cin >> a[i];
vals.push_back(a[i]);
p[i] = p[i - 1] + a[i];
}
vector<pair<int, pair<int, int>>> queries;
int q; cin >> q;
for(int i = 0; i < q; i++) {
int t, l, r; cin >> t >> l >> r;
if(t == 1) {
vals.push_back(r);
}
queries.push_back({t, {l, r}});
}
sort(all(vals));
uniq(vals);
for(int i = 1; i <= n; i++) {
b[i] = lower_bound(all(vals), a[i]) - vals.begin();
}
for(int i = 0; i < q; i++) {
int type = queries[i].first;
if(type == 1) {
int x, y;
x = queries[i].second.first;
y = queries[i].second.second;
a[x] = y;
b[x] = lower_bound(all(vals), y) - vals.begin();
for(int i = 1; i <= n; i++) {
p[i] = p[i - 1] + a[i];
}
} else {
int l = queries[i].second.first;
int r = queries[i].second.second;
vector<int> lower_bigger(n + 1, l - 1);
vector<int> upper_bigger(n + 1, r + 1);
stack<pair<int, int>> st;
for(int i = l; i <= r; i++) {
while(!st.empty() && st.top().first < a[i]) {
upper_bigger[st.top().second] = i;
st.pop();
}
st.push({a[i], i});
ok[i] = false;
indices[b[i]].push_back(i);
}
while(!st.empty()) st.pop();
for(int i = r; i >= l; i--) {
while(!st.empty() && st.top().first < a[i]) {
lower_bigger[st.top().second] = i;
st.pop();
}
st.push({a[i], i});
}
int it = 0, answ = 0;
for(int i = sz(vals) - 1; i >= 0; i--) {
if(indices[i].empty()) continue;
if(it == 0) {
for(auto j: indices[i]) {
ok[j] = true;
answ++;
}
} else {
for(auto j: indices[i]) {
int li = lower_bigger[j], ri = upper_bigger[j];
long long s = p[ri - 1] - p[li];
if(li >= l && s >= a[li] && ok[li]) {
ok[j] = true;
answ++;
} else if(ri <= r && s >= a[ri] && ok[ri]) {
ok[j] = true;
answ++;
}
}
}
indices[i].clear();
it++;
}
cout << answ << '\n';
}
}
}
int main() {
setIO();
auto solve = [&](int test_case)-> void {
while(test_case--) {
solve_();
}
};
int test_cases = 1;
// cin >> test_cases;
solve(test_cases);
return 0;
}
