#include <bits/stdc++.h>
using namespace std;
int main(){
    int N;
    cin>>N;
    vector<int> L(N);
    for(int i=0;i<N;i++){
        cin>>L[i];
    }
    int T;
    cin>>T;
    string name;
    int people=0;
    char P;
    map<string,int> m,last;
    map<int,string> revm;
    vector<int> answered(N);
    vector<vector<int>> ans(0,vector<int>(N+2));
    for(int i=0;i<T;i++){
        cin>>name>>P;
        if(!m.count(name)){
            m[name]=people;
            revm[people]=name;
            people++;
            ans.push_back(vector<int>(N+2));
            ans[people-1][0]=people-1;
        }
        last[name]=i;
        answered[P-'A']++;
        ans[m[name]][P-'A'+1]=floor(50.0*L[P-'A']*(1.0+1.0/(0.8+0.2*answered[P-'A'])));
        ans[m[name]][N+1]+=floor(50.0*L[P-'A']*(1.0+1.0/(0.8+0.2*answered[P-'A'])));
    }
    auto fn=[&](vector<int>& a,vector<int>& b){
        if(a[N+1]==b[N+1]){
            return last[revm[a[0]]]<last[revm[b[0]]];
        }
        return a[N+1]>b[N+1];
    };
    sort(ans.begin(),ans.end(),fn);
    for(int i=1;i<=people;i++){
        cout<<i<<" ";
        cout<<revm[ans[i-1][0]]<<" ";
        for(int j=1;j<N+2;j++){
            cout<<ans[i-1][j]<<" ";
        }
        cout<<endl;
    }
}