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

const int N = 4e5 + 5 , inf = 1e9;

int n , q , a[N] , mx , vis[N << 2];

struct node {
	int cnt , sum;
}tr[N << 2];

struct Q{
	int opt , a , b;
}o[N / 4 + 4];

struct Node {
	int p , cnt , sum;
};

vector <int> v; 

stack <Node> s; 

void push_up(int p) {
	tr[p].cnt = tr[p << 1].cnt + tr[p << 1 | 1].cnt;
	tr[p].sum = tr[p << 1].sum + tr[p << 1 | 1].sum;
}

void modify(int p , int l , int r , int pos , int det) {
	if(l == r) {
		tr[p].cnt += det;
		tr[p].sum += det * v[l - 1];
		return ;
	}
	int mid = l + r >> 1;
	if(mid >= pos) modify(p << 1 , l , mid , pos , det);
	else modify(p << 1 | 1 , mid + 1 , r , pos , det); 
	push_up(p);
}

int query (int p , int l , int r , int x) {
	if(!tr[p].sum) return 0;
	if(x <= l && l == r) return l;
	int mid = l + r >> 1;
	if(x <= mid) {
		int res = query(p << 1 , l , mid , x);
		if(res) return res;
	}
	return query(p << 1 | 1 , mid + 1 , r , x);
}

int ans = 0;

void calc(int p , int l , int r , int pos , int &tmp) {
	if(tmp <= 0 || !tr[p].sum) return ;
	if(!vis[p]) vis[p] = 1 , s.push((Node){p , tr[p].cnt , tr[p].sum});
	int mid = l + r >> 1;
	if(r <= pos) {
		if(l == r) {
			int x = min((tmp + v[l - 1] - 1) / v[l - 1] , tr[p].cnt);
			tr[p].cnt -= x; tr[p].sum -= x * v[l - 1];
			ans += x; tmp -= x * v[l - 1];
			return ;
		}
		else if(tr[p << 1 | 1].sum <= tmp) {
			if(!vis[p << 1 | 1]) vis[p << 1 | 1] = 1 , s.push((Node) {p << 1 | 1 , tr[p << 1 | 1].cnt , tr[p << 1 | 1].sum});
			ans += tr[p << 1 | 1].cnt; tmp -= tr[p << 1 | 1].sum;
			tr[p << 1 | 1] = {0 , 0};
			calc(p << 1 , l , mid , pos , tmp);
		}
		else calc(p << 1 | 1 , mid + 1 , r , pos , tmp); push_up(p);
		return ;
	} 
	if(pos > mid) calc(p << 1 | 1 , mid + 1 , r , pos , tmp);
	calc(p << 1 , l , mid , pos , tmp);
	push_up(p);
}

void solve(int x , int y) {
	if(x >= y) return cout << 0 << '\n' , void();
	if(x <= v[0]) return cout << -1 << '\n' , void(); ans = 0;
	while(x < y) {
		int pos = lower_bound(v.begin() , v.end() , x) - v.begin() + 1;
		int pos1 = query(1 , 1 , mx , pos); 
		int tmp = min(v[pos1 - 1] + 1 , y) - x;
		int d = tmp; pos --;
		calc(1 , 1 , mx , pos , tmp);
		if(tmp > 0) {
			ans = -1; break;
		} 
		x += d - tmp;
	}
	cout << ans << '\n';
	while(!s.empty()) {
		tr[s.top().p] = {s.top().cnt , s.top().sum};
		vis[s.top().p] = 0; s.pop();
	}
}

signed main() {
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	cin >> n; for (int i = 1;i <= n;i ++) cin >> a[i] , v.push_back(a[i]);
	cin >> q; for (int i = 1;i <= q;i ++) {
		cin >> o[i].opt;
		if(o[i].opt == 1) cin >> o[i].a >> o[i].b;
		else cin >> o[i].a , v.push_back(o[i].a);
	} 
	sort(v.begin() , v.end()); v.erase(unique(v.begin() , v.end()) , v.end()); v.push_back(inf * inf / 100);
	for (int i = 1;i <= n;i ++) a[i] = lower_bound(v.begin() , v.end() , a[i]) - v.begin() + 1 , mx = max(mx , a[i]);
	for (int i = 1;i <= q;i ++)
		if(o[i].opt != 1)
			o[i].a = lower_bound(v.begin() , v.end() , o[i].a) - v.begin() + 1;
	mx = v.size(); modify(1 , 1 , mx , mx , 1);
	for (int i = 1;i <= n;i ++) modify(1 , 1 , mx , a[i] , 1);
	for (int i = 1;i <= q;i ++) {
		if(o[i].opt == 1) solve(o[i].a , o[i].b);
		else modify(1 , 1 , mx , o[i].a , o[i].opt == 2 ? 1 : -1);
	}
	return 0;
}
/*
32
2 24547 5660 80752 6 1 304 738 1 18010 88 67 1 1 12654 1 1021 1 15 1 3 76 5 1 26582 722 50 2 4 4114 992 1
13
2 25
2 1
3 1
3 26582
2 61
3 1
2 124
2 48
3 304
2 13
2 166
2 1
1 85 6484
*/