#include<bits/stdc++.h>
using namespace std;

#define int long long
typedef vector<int>vint;
typedef pair<int,int>pint;
typedef vector<pint>vpint;
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,f,n) for(int i=(f);i<(n);i++)
#define all(v) (v).begin(),(v).end()
#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)
#define pb push_back
#define fi first
#define se second
template<typename A,typename B>inline void chmin(A &a,B b){if(a>b)a=b;}
template<typename A,typename B>inline void chmax(A &a,B b){if(a<b)a=b;}

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

int N;
int L[26];
struct par{
    string S;
    int P;
    int T;
    vint V;
    par(string s):S(s),P(0),T(0),V(N){}

    bool operator<(const par &p)const {
        if(P!=p.P)return P>p.P;
        return T<p.T;
    }
};

signed main(){
    cin>>N;rep(i,N)cin>>L[i];
    int T;cin>>T;
    int cnt[26]={};

    vector<par>vec;
    rep(i,T){
        string name;
        char c;
        cin>>name>>c;
        int tmp=f(L[c-'A'],++cnt[c-'A']);
        int cur=-1;
        rep(j,vec.size())if(vec[j].S==name)cur=j;
        if(cur==-1){
            cur=vec.size();
            vec.pb(par(name));
        }
        vec[cur].P+=tmp;
        vec[cur].V[c-'A']=tmp;
        vec[cur].T=i;
    }
    sort(all(vec));
    rep(i,vec.size()){
        cout<<i+1<<" "<<vec[i].S;
        rep(j,N)cout<<" "<<vec[i].V[j];
        cout<<" "<<vec[i].P<<endl;
    }
    return 0;
}