#include <bits/stdc++.h>
using namespace std;
int n, q;
int c;
int ile = 0;
unsigned long long a;
unsigned long long b;
int odw[400000];
multiset<unsigned long long> t;
multiset<unsigned long long>::iterator it;
multiset<unsigned long long>::iterator pom;
int binarySearch( int l, int r, int x)
{
it = t.begin();
pom = t.begin();
int mid = l + (r - l) / 2;
advance(it, mid);
advance(pom, mid-1);
if (r >= l) {
if (mid == 0 || (*it == x && x > *pom) )
return mid;
else if (*it < x)
return binarySearch( mid+1, r, x);
else
return binarySearch(l, mid-1, x);
}
if(mid != 0)
return mid;
else
return -1;
}
int main()
{
scanf("%d", &n);
for(int i = 0; i < n; ++i){
scanf("%lld", &a);
t.insert(a);
}
scanf("%d", &q);
for(int i = 1; i <= q; ++i){
scanf("%d", &c);
ile = 0;
if(c == 2){
scanf("%lld", &a);
t.insert(a);
}
else if(c == 3){
scanf("%lld", &a);
it = t.find( a);
odw[distance(t.begin(), it)] = -1;
//t.erase( it);
}
else{
scanf("%lld%lld", &a, &b );
while(a < b){
int mx = binarySearch( 0, t.size()-1, a);
//cout<<mx<<endl;
for(int j = mx-1; j >=0; j--){
if(odw[j] != i && odw[j] != -1){
it = t.begin();
advance(it, j);
a+=*it;
// cout<<*it<<"GG"<<endl;
ile++;
odw[j]= i;
break;
}
else if(j == 0 && odw[j] == i){
ile = -1;
a = b;
}
}
}
printf("%d\n", ile);
}
}
return 0;
}