#include <cstdio>
#include <cmath>

#include <iostream>
#include <string>
#include <map>
#include <vector>
#include <algorithm>

#define incID(i, l, r) for(int i = (l)    ; i <  (r); i++)
#define incII(i, l, r) for(int i = (l)    ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); i--)
#define inc( i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define dec( i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)

typedef long long   signed int LL;
typedef long long unsigned int LU;

template<typename T> void swap(T &x, T &y) { T t = x; x = y; y = t; return; }
template<typename T> T abs(T x) { return (0 <= x ? x : -x); }
template<typename T> T max(T a, T b) { return (b <= a ? a : b); }
template<typename T> T min(T a, T b) { return (a <= b ? a : b); }
template<typename T> bool setmin(T &a, T b) { if(a <= b) { return false; } else { a = b; return true; } }
template<typename T> bool setmax(T &a, T b) { if(b <= a) { return false; } else { a = b; return true; } }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }

// ---- ----

int n, l[26], t;
int ac[26], counter;
LL score[500000], at[500000];
std::map<std::string, int> m;
std::vector<LL> v;

int main() {
	scanf("%d", &n);
	inc(i, n) { scanf("%d", &l[i]); }
	scanf("%d", &t);
	inc(i, t) {
		std::string name;
		char p;
		std::cin >> name >> p;
		
		if(p == '?') {
			int id = m.find(name) -> second;
			printf("%d\n", v.end() - std::lower_bound(v.begin(), v.end(), score[id]));
		} else {
			auto it = m.find(name);
			bool new_flag = (it == m.end());
			if(new_flag) {
				it = (m.insert(std::make_pair(name, counter++))).first;
			}
			int id = it -> second;
			
			int prob = p - 'A';
			ac[prob]++;
			at[id] = i - at[id];
			LL plus = ( 50 * l[prob] + (500 * l[prob]) / (8 + 2 * ac[prob]) ) * 600000L - at[id];
			
			if(new_flag) { v.push_back(plus); } 
			else { *std::lower_bound(v.begin(), v.end(), score[id]) += plus; }
			std::sort(v.begin(), v.end());
			score[id] += plus;
		}
	}
	
	return 0;
}