#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)



template<class V, int ME> class BIT {
public:
    V bit[1 << ME];
    V operator()(int e) { V s = 0; e++; while (e) s += bit[e - 1], e -= e&-e; return s; }
    void add(int e, V v) { e++; while (e <= 1 << ME) bit[e - 1] += v, e += e&-e; }
    int lower_bound(V val) {
        V tv = 0; int i, ent = 0;
        for (i = ME - 1; i >= 0; i--) if (tv + bit[ent + (1 << i) - 1] <= val) tv += bit[ent + (1 << i) - 1], ent += (1 << i);
        return ent;
    }
};
//-----------------------------------------------------------------------------------
int N, L[30], T;
int M; string Dic[101010];
int ID[101010], Pro[101010];
//-----------------------------------------------------------------------------------
string Name[101010]; char P[101010];
void init() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    cin >> N;
    rep(i, 0, N) cin >> L[i];
    cin >> T;
    rep(i, 0, T) cin >> Name[i] >> P[i];

    map<string, int> za;
    rep(i, 0, T) za[Name[i]] = 0;
    M = za.size();
    int idx = 0;
    for (auto& p : za) za[p.first] = idx, idx++;
    for (auto& p : za) Dic[p.second] = p.first;

    rep(i, 0, T) {
        ID[i] = za[Name[i]];
        if(P[i] == '?') Pro[i] = -1;
        else Pro[i] = P[i] - 'A';
    }
}
//-----------------------------------------------------------------------------------
int cnt[30];
int E[101010][30];
int sm[101010], lastsub[101010];
BIT<int,18> bit;
int main() {
    init();

    vector<pair<int, int>> v;

    rep(t, 0, T) {
        int id = ID[t];
        int pid = Pro[t];

        if (pid < 0) continue;
        
        int rank = cnt[pid] + 1;
        cnt[pid]++;

        int p = 50 * L[pid] + 500 * L[pid] / (8 + 2 * rank);

        E[id][pid] = p;
        sm[id] += p;
        lastsub[id] = t;

        v.push_back({ sm[id], lastsub[id] });
    }

    sort(v.begin(), v.end(), [&](pair<int, int> a, pair<int, int> b) {
        if (a.first != b.first) return a.first > b.first;
        else return a.second < b.second;
    });
    map<pair<int, int>, int> vv;
    rep(i, 0, v.size()) vv[v[i]] = i;

    rep(i, 0, N) cnt[i] = 0;
    rep(i, 0, M) rep(j, 0, 30) E[i][j] = 0;
    rep(i, 0, M) sm[i] = lastsub[i] = 0;

    rep(t, 0, T) {
        int id = ID[t];
        int pid = Pro[t];

        if (pid < 0) {
            int ans = bit(vv[{sm[id], lastsub[id]}]);
            printf("%d\n", ans);
        } else {
            int rank = cnt[pid] + 1;
            cnt[pid]++;

            int p = 50 * L[pid] + 500 * L[pid] / (8 + 2 * rank);

            if (sm[id] != 0) bit.add(vv[{sm[id], lastsub[id]}], -1);

            E[id][pid] = p;
            sm[id] += p;
            lastsub[id] = t;

            bit.add(vv[{sm[id], lastsub[id]}], 1);
        }
    }
}