#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int maxn=4e5+5;
ll w[maxn],b[maxn];
int n,q,tot,op[maxn];
ll s[maxn],k[maxn];
ll T[maxn<<2];//权值和 
int cnt[maxn<<2];//个数
int tag[maxn<<2];//标记永久化
struct node{
	int id,cnt;
	ll sum;
};//原本点的权值，用于还原
vector<node> re;
#define lc (rt<<1)
#define rc (rt<<1|1)
inline void up_data(int rt,int l,int r,int pos,int op){
	cnt[rt]+=op;
	T[rt]+=(ll)op*b[pos];
	if(l==r) return;
	int mid=(l+r)>>1;
	if(pos<=mid) up_data(lc,l,mid,pos,op);
	else up_data(rc,mid+1,r,pos,op);
}
inline ll ask(int rt,int l,int r,int L,int R,int tg){//询问 L~R 的区间和 
	if(L>R) return 0;
	tg*=(1-tag[rt]);
	if(L<=l && r<=R){
//		cout<<b[l]<<" "<<b[r]<<" "<<tg*T[rt]<<endl;
//		if(b[l]==16 && b[r]==23){
//			cout<<"??"<<T[lc]<<" "<<T[rc]<<endl;
//		}
		return tg*T[rt];
	}
	int mid=(l+r)>>1;
	ll val=0;
	if(L<=mid) val+=ask(lc,l,mid,L,R,tg);
	if(R>mid) val+=ask(rc,mid+1,r,L,R,tg);
//	cout<<"???:"<<b[l]<<" "<<b[r]<<" "<<val<<endl;
	return val;
}
inline int ask2(int rt,int l,int r,int L,int R,int tg){//询问 L~R 的区间数量和
	if(L>R) return 0;
	tg*=(1-tag[rt]);
	if(L<=l && r<=R) return tg*cnt[rt];
	int mid=(l+r)>>1;
	int val=0;
	if(L<=mid) val+=ask2(lc,l,mid,L,R,tg);
	if(R>mid) val+=ask2(rc,mid+1,r,L,R,tg);
	return val;
}
const ll INF=2e18;
inline void solve1(int rt,int l,int r,int L,int R){//区间置 0 
	if(L>R) return ;
	if(L<=l && r<=R){
		re.push_back((node){rt,cnt[rt],T[rt]});
		tag[rt]=1;
		cnt[rt]=T[rt]=0;
		return ;
	}
	int mid=(l+r)>>1;
	if(L<=mid) solve1(lc,l,mid,L,R);
	if(R>mid) solve1(rc,mid+1,r,L,R);
	T[rt]=T[lc]+T[rc];
	cnt[rt]=cnt[lc]+cnt[rc];
}
inline void solve2(int rt,int l,int r,int pos,int ct){//单点减数 
	if(l==r){
		re.push_back((node){rt,ct,(ll)ct*b[l]});
		T[rt]-=(ll)ct*b[l];
		cnt[rt]-=ct;
//		assert(cnt[rt]>=0);
//		assert(T[rt]>=0);
		return ;
	}
	int mid=(l+r)>>1;
	if(pos<=mid) solve2(lc,l,mid,pos,ct);
	else solve2(rc,mid+1,r,pos,ct);
	T[rt]=T[lc]+T[rc];
	cnt[rt]=cnt[lc]+cnt[rc];
}
inline void Re(node x){//还原 
	tag[x.id]=0;
	T[x.id]+=x.sum,cnt[x.id]+=x.cnt;
//	cout<<T[1]<<endl;
//	cout<<x.sum<<" "<<x.cnt<<" "<<x.id<<" fuckyou"<<endl;
	x.id>>=1;
	while(x.id){
		T[x.id]+=x.sum;
		cnt[x.id]+=x.cnt;
		x.id>>=1;
	}
}
//鱼体重不去重真的恶心，令人高潮 
int main(){
	scanf("%d",&n);
	for(int i=1;i<=n;i++) scanf("%lld",&w[i]),b[++tot]=w[i];
	scanf("%d",&q);
	for(int i=1;i<=q;i++){
		scanf("%d",&op[i]);
		if(op[i]==1) scanf("%lld%lld",&s[i],&k[i]);
		else if(op[i]==2) scanf("%lld",&s[i]),b[++tot]=s[i];
		else scanf("%lld",&s[i]);
	}
	sort(b+1,b+tot+1);
	tot=unique(b+1,b+tot+1)-(b+1);
	for(int i=1;i<=n;i++){
		int ps=lower_bound(b+1,b+tot+1,w[i])-b;
		up_data(1,1,tot,ps,1);
	}
	for(int i=1;i<=q;i++){
		if(op[i]==1){
			re.clear();
			int ans=0;
			k[i]--;
			while(s[i]<=k[i]){
				int ps=lower_bound(b+1,b+tot+1,s[i])-b;
				ll hj;
				if(ps>tot) hj=INF;
				else{
					int l=ps,r=tot;
					while(l<r){
						int mid=(l+r)>>1;
						if(ask2(1,1,tot,ps,mid,1)>0) r=mid;
						else l=mid+1; 
					}
					if(ask2(1,1,tot,ps,l,1)==0) hj=INF;
					else hj=b[l];
				}
				hj=min(hj,k[i]);
				ll delta=hj-s[i]+1;
				int ps2=ps-1;
				int l=1,r=ps2;
//				cout<<delta<<endl;
				while(l<r){
					int mid=(l+r+1)>>1;
//					if(i==5){
//						cout<<b[l]<<" "<<b[r]<<endl;
//					cout<<b[mid]<<":"<<ask(1,1,tot,mid,ps2,1)<<"???"<<endl;
//					}
					if(ask(1,1,tot,mid,ps2,1)>=delta) l=mid;
					else r=mid-1;
				}
				ll vv=ask(1,1,tot,l,ps2,1);
				if(vv==0 || vv<delta){
					ans=-1;
					break;
				}
				ll val=ask(1,1,tot,l+1,ps2,1);
				delta-=val;
				ans+=ask2(1,1,tot,l+1,ps2,1);
				s[i]+=val;
				int ct2=delta/b[l]+(delta%b[l]>0);
				ans+=ct2;
				s[i]+=b[l]*(ll)ct2;
//				if(i==5){
//					cout<<l<<" "<<ps2<<" "<<b[l]<<" "<<b[l+1]<<" "<<b[ps2]<<" pyb\n";
//					cout<<ask(1,1,tot,l,ps2,1)<<" \n "<<ask(1,1,tot,l+1,ps2,1)<<endl;
//					cout<<ask(1,1,tot,l,l,1)<<endl;
//					cout<<b[l]<<" "<<ct2<<" "<<delta<<" czc"<<endl; 
//				}
				solve1(1,1,tot,l+1,ps2);
				solve2(1,1,tot,l,ct2);
			}
			for(auto x:re) Re(x);
			printf("%d\n",ans);
		}
		else if(op[i]==2){
			int ps=lower_bound(b+1,b+tot+1,s[i])-b;
			up_data(1,1,tot,ps,1);
		}
		else{
			int ps=lower_bound(b+1,b+tot+1,s[i])-b;
			up_data(1,1,tot,ps,-1);
		}
//		cout<<i<<":\n";
//		for(int j=1;j<=12;j++){
//			cout<<j<<" "<<T[j]<<" "<<cnt[j]<<" "<<tag[j]<<endl;
//		}
	}
	return 0;
}