#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define mt make_tuple
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;

template<class Val>
struct BinaryIndexedTree{
    int n;
    vector<Val> t;
    BinaryIndexedTree(){}
    BinaryIndexedTree(int _n):n(_n+1), t(_n+1){}
    void add(int k, Val val){
        k++;
        while(k < n){
            t[k] += val;
            k += (k&-k);
        }
    }
    Val sum(int k){
        Val r = 0;
        while(k > 0){
            r += t[k];
            k -= (k&-k);
        }
        return r;
    }
    Val sum(int l, int r){
        return sum(r) - sum(l);
    }
};
typedef BinaryIndexedTree<int> BIT;

int f(int x, int y) {
    return 50 * x + 500 * x / (8 + 2 * y);
}

int MA = 300000010;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int N;
    while(cin >> N) {
        BIT sum(MA);

        vi L(N);
        vi cnt(N);

        map<string, int> pt;
        rep(i, N) {
            cin >> L[i];
        }

        // ポイント=>pair<名前、時刻>
        map<int, set<pair<string, int>>> ptn;

        int T;
        cin >> T;
        rep(i, T) {
            string name;
            char c;
            cin >> name >> c;
            
            if(c == '?') {
                int x = pt[name];
                int rank = sum.sum(x + 1, MA);
                vector<pair<int, string>> v;
                each(p, ptn[pt[name]]) {
                    v.emplace_back(p.second, p.first);
                }
                sort(all(v));
                rep(j, sz(v)) {
                    ++rank;
                    if(v[j].second == name) {
                        break;
                    }
                }
                cout << rank << endl;
            } else {
                int p = c - 'A';
                // f(L[p], ++cnt[p]);
                if(pt.count(name)) {
                    sum.add(pt[name], -1);
                    auto it = ptn[pt[name]].lower_bound(mp(name, 0));
                    ptn[pt[name]].erase(it);
                }
                pt[name] += f(L[p], ++cnt[p]);
                sum.add(pt[name], 1);
                
                ptn[pt[name]].insert(mp(name, i));
            }
        }
    }
}