#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m; i >= n; --i)
#define ALL(v) (v).begin(),(v).end()
#define ALLR(v) (v).rbegin(),(v).rend()
#define fi first
#define se second
#define PB push_back
#define EB emplace_back
template<typename T> using PQ = priority_queue<T>;
template<typename T> using QP = priority_queue<T,vector<T>,greater<T>>;
template<typename T>void debug(const T &v,ll h,ll w){for(ll i=0;i<h;i++){for(ll j=0;j<w;j++)cerr<<v[i][j]<<" \n"[j==w-1];}};
template<typename T>void debug(const T &v,ll n){for(ll i=0;i<n;i++)cerr<<v[i]<<" \n"[i==n-1];};
template<typename T>void debug(const vector<T>&v){debug(v,v.size());}
template<typename T>void debug(const vector<vector<T>>&v){for(auto &vv:v)debug(vv,vv.size());}
template<typename T>void debug(stack<T> st){while(!st.empty()){cerr<<st.top()<<" ";st.pop();}cerr<<endl;}
template<typename T>void debug(queue<T> st){while(!st.empty()){cerr<<st.front()<<" ";st.pop();}cerr<<endl;}
template<typename T>void debug(deque<T> st){while(!st.empty()){cerr<<st.front()<<" ";st.pop_front();}cerr<<endl;}
template<typename T>void debug(PQ<T> st){while(!st.empty()){cerr<<st.top()<<" ";st.pop();}cerr<<endl;}
template<typename T>void debug(QP<T> st){while(!st.empty()){cerr<<st.top()<<" ";st.pop();}cerr<<endl;}
template<typename T>void debug(const set<T>&v){for(auto z:v)cerr<<z<<" ";cerr<<endl;}
template<typename T>void debug(const multiset<T>&v){for(auto z:v)cerr<<z<<" ";cerr<<endl;}
template<typename T,size_t size>void debug(const array<T, size> &a){for(auto z:a)cerr<<z<<" ";cerr<<endl;}
template<typename T,typename V>void debug(const map<T,V>&v){for(auto z:v)cerr<<"["<<z.first<<"]="<<z.second<<",";cerr<<endl;}
void foo() {cerr << endl;}
template <class Head, class... Tail>void foo(Head&& head, Tail&&... tail){cerr << head << " ";foo(move(tail)...);}
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
int popcount(ll x){return __builtin_popcountll(x);};
int poplow(ll x){return __builtin_ctzll(x);};
int pophigh(ll x){return 63 - __builtin_clzll(x);};
const ll INF=1LL<<60;
const int inf=(1<<30)-1;
// const int mod=1e9+7;
const int mod=998244353;
int dx[8]={1,0,-1,0,-1,-1,1,1};
int dy[8]={0,1,0,-1,-1,1,-1,1};

using mint=modint998244353;
// using mint=modint1000000007;

int sc(int n,int k){return 50*n+50*n*5/(4+k);}

int op(int a,int b){return a+b;}
int e(){return 0;}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n;cin >> n;
    vector<int> l(n);
    REP(i,n) cin >> l[i];
    int t;cin >> t;
    map<string,int> a;
    vector<int> b(n,1);
    vector<string> s(t);
    vector<char> p(t);
    vector<pair<int,int>> x;
    REP(i,t){
        cin >> s[i] >> p[i];
        if(p[i]=='?') continue;
        int id=p[i]-'A';
        a[s[i]]+=sc(l[id],b[id]);
        b[id]++;
        x.PB({a[s[i]],-i});
    }
    int m=x.size();
    sort(ALLR(x));
    map<pair<int,int>,int> pt;
    REP(i,m) pt[x[i]]=i;
    map<string,int> aa,c;
    vector<int> bb(n,1);
    segtree<int,op,e> seg(m);
    // REP(i,m) foo(x[i].fi,x[i].se);
    REP(i,t){
        if(p[i]!='?'){
            int id=p[i]-'A';
            if(pt.count({aa[s[i]],-c[s[i]]})) seg.set(pt[{aa[s[i]],-c[s[i]]}],0);
            aa[s[i]]+=sc(l[id],bb[id]);
            bb[id]++;
            c[s[i]]=i;
            // foo(i,aa[s[i]],s[i]);
            seg.set(pt[{aa[s[i]],-i}],1);
        }
        else{
            int id=pt[{aa[s[i]],-c[s[i]]}];
            cout << seg.prod(0,id)+1 << endl;
        }
        // REP(j,m) cerr << seg.get(j) << " ";
        // cerr << endl;
    }
}