#include <bits/stdc++.h>
using namespace std;
// #define int long long
using ll=long long;
using vi=vector<int>;
using vl=vector<long long>;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
#define ITR(v,c) for(auto v=begin(c);v!=end(c);++v)
#define FORE(x,c) for(auto &x:c)
#define FOR(v,a,n) for(int v=a;v<(int)(n);++v)
#define REP(v,n) FOR(v,0,n)
#define RREP(v,n) for(int v=((int)(n)-1);v>=0;--v)
#define ALL(c) begin(c),end(c)
#define RALL(c) rbegin(c),rend(c)
#define SZ(c) ((int)c.size())
const int DX[9]={0,1,0,-1,1,1,-1,-1,0}, DY[9]={-1,0,1,0,-1,1,1,-1,0};
const int INF=1e9; const long long INFLL=1e18;
template<class T> ostream& operator << (ostream &os, const vector<T> &v) {
    ITR(i,v) os<<*i<<(i==end(v)-1?"":" "); return os; }
template<class T> istream& operator >> (istream &is, vector<T> &v) {
    ITR(i,v) is>>*i; return is; }
//------------------------------------------------------------------------------

// N:=☆の数 K:=AC順位
int score(double N,double K) {
    return floor(50*N+(50*N/(0.8+0.2*K)));
}
struct user {
    string name;
    vl s;
    ll sum;
    int actime;
};
bool stronger(const user &a, const user &b) { return (a.sum==b.sum?(a.actime<b.actime):(a.sum>b.sum)); }
signed main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    int N;
    cin>>N;
    vl L(N);
    cin>>L;
    int T;
    cin>>T;

    vl ac(N,0);
    map<string,vl> m;
    REP(i,T) {
        string name;
        char P;
        cin>>name>>P;
        P-='A';
        ac[P]++;
        if(m.find(name)==end(m)) {
            m[name].resize(N+1);
        }
        m[name][P+1]=score(L[P],ac[P]);
        if(score(L[P],ac[P])>0) m[name][0]=i;
    }

    vector<user> users;
    ITR(itr,m) {
        user u;
        u.name=itr->first;
        u.actime=itr->second[0];
        ll s=0;
        REP(i,N) {
            u.s.push_back(itr->second[1+i]);
            s+=itr->second[1+i];
        }
        u.sum=s;
        users.push_back(u);
    }
    sort(ALL(users),stronger);
    REP(i,SZ(users)) {
        cout<<i+1<<" "<<users[i].name<<" ";
        REP(j,N) {
            cout<<users[i].s[j]<<" ";
            if(j==N-1) cout<<users[i].sum<<endl;
        }
    }
    return 0;
}