#define _USE_MATH_DEFINES
#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <complex>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <limits>
#include <climits>
#include <cfloat>
#include <functional>
#include <iterator>
using namespace std;

class BinaryIndexedTree
{
private:
    int n;
    vector<int> data;
public:
    BinaryIndexedTree(int n){ // コンストラクタ
        this->n = n;
        data.assign(n+1, 0);
    }
    void add(int k, int x){ // k番目の要素にxを加算する
        ++ k;
        while(k <= n){
            data[k] += x;
            k += k & -k;
        }
    }
    int sum(int k){ // 区間[0,k]の総和を返す
        ++ k;
        int ret = 0;
        while(k > 0){
            ret += data[k];
            k -= k & -k;
        }
        return ret;
    }
    int sum(int a, int b){ // 区間[a,b]の総和を返す
        return sum(b) - sum(a-1);
    }
};

int getScore(int n, int k)
{
    return 50 * n + (500 * n) / (8 + 2 * k);
}

int main()
{
    int n;
    cin >> n;
    vector<int> level(n);
    for(int i=0; i<n; ++i)
        cin >> level[i];

    int t;
    cin >> t;
    vector<string> name(t);
    vector<char> p(t);
    for(int i=0; i<t; ++i)
        cin >> name[i] >> p[i];

    vector<int> submitNum(n, 0);
    map<string, int> sum;
    map<pair<int, int>, int> index;
    for(int i=0; i<t; ++i){
        if(p[i] != '?'){
            int x = p[i] - 'A';
            ++ submitNum[x];
            sum[name[i]] += getScore(level[x], submitNum[x]);
            index[make_pair(sum[name[i]], -i)];
        }
    }

    int cnt = 0;
    for(auto& p : index){
        p.second = cnt;
        ++ cnt;
    }

    BinaryIndexedTree bit(index.size());
    map<string, int> lastSubmit;
    submitNum.assign(n, 0);
    sum.clear();
    for(int i=0; i<t; ++i){
        if(p[i] != '?'){
            if(sum.find(name[i]) != sum.end())
                bit.add(index[make_pair(sum[name[i]], lastSubmit[name[i]])], -1);
            int x = p[i] - 'A';
            ++ submitNum[x];
            sum[name[i]] += getScore(level[x], submitNum[x]);
            lastSubmit[name[i]] = -i;
            bit.add(index[make_pair(sum[name[i]], lastSubmit[name[i]])], +1);
        }
        else{
            int ans = bit.sum(index[make_pair(sum[name[i]], lastSubmit[name[i]])], index.size()-1);
            cout << ans << endl;
        }
    }

    return 0;
}