#include <bits/stdc++.h>


#define rep(x,to) for(int (x)=0;(x)<(to);(x)++)
#define all(c) (c).begin(),(c).end()
#define sz(v) (int)(v).size()
#define dnmin(a,b) (a)=min((a),(b))

using namespace std;
typedef vector<int> VI;
typedef pair<int, int> pii;

struct Bitree {
	typedef int btT;
	vector<btT> bv;
	Bitree(int n) : bv(n + 3) {}
	btT sum(int i) {
		btT res=0; for(i++; i>0; i -= i & -i) res += bv[i]; return res;
	}
	btT sum(int a, int b) {return sum(b) - (a? sum(a-1): 0);}
	void add(int i, btT x){for(i++; i<(int)bv.size(); i += i & -i) bv[i] += x; }
	void updt(int i, btT x){ add(i, x - sum(i,i));} //replace, update
};


int main(){
 
	int n, t, mno=0;
	cin >>n;
	VI hs(n);
	unordered_map<string, VI> mp;
	map<int64_t, int> zat;
	rep(i,n) cin >>hs[i];
	cin >> t;
	VI nos(n),  nm(t);
	vector<int64_t> vl(t);
	rep(i, t){
		string s; char a;
		cin >> s >> a;
		if(!mp.count(s)) mp[s] = VI{ 0,0, ++mno};
		if(a != '?'){
			mp[s][1] = i+1;
			int mz= a-'A';
			mp[s][0] += 50 * hs[mz] + (500 * hs[mz]) / (8 + 2* (++nos[mz]));
			vl[i]  = 1000000LL * mp[s][0] + 500000LL - mp[s][1];
			zat[vl[i]] = 0;
		}
		nm[i] = mp[s][2] * 10 + (a=='?');
	}
	int ct=1;
	for(auto& x: zat) x.second = ct++;
	
	VI cpt(sz(mp)+4);
	Bitree bta(t+10);

	rep(i,t){
		if(nm[i]%10 !=1 ){
			if(cpt[nm[i]/10] !=0 ) bta.add(cpt[nm[i]/10], -1);
			bta.add(zat[vl[i]], 1);
			cpt[nm[i]/10] = zat[vl[i]];
		}else{
			int ans = bta.sum(cpt[nm[i]/10] + 1, t + 5);
			cout << ans + 1 << "\n";
		}
	}
	//for(auto x: cpt) printf("%d:%d  ",x.first, x.second);
	//rep(i,t+1) printf("%d:%d  ",i,bta.sum(i,i));
	//return 0;
}