#include<iostream>
#include<cmath>
#include<map>
#include<vector>
#include<algorithm>
#include<string>
using namespace std;
typedef pair<int,string> P;

int main(){
    map<string,map<char,int> > m;
    
    map<char,int> dict;
    for(int i=0;i<26;i++){
        char tmp='A'+i;
        dict[tmp]=i;
    }
    int N;
    cin>>N;
    int diffi[26];
    for(int i=0;i<N;i++){
        cin>>diffi[i];
    }
    int appea[26]={};
    int K;
    cin>>K;
    for(int i=0;i<K;i++){
        string str;
        char tmp;
        cin>>str>>tmp;
        appea[dict[tmp]]++;
        //点数の計算
        double wari = 0.8+0.2*appea[dict[tmp]];
        int poi = 50*diffi[dict[tmp]] + (int)((50.0*diffi[dict[tmp]])/wari);
        m[str][tmp]=poi;
    }
    P suum[4001];
    int l=0;
    for(map<string,map<char,int> >::iterator itr=m.begin();itr!=m.end();itr++){
        int tot=0;
        for(int i=0;i<N;i++){
            char tmp='A'+i;
            tot+=((*itr).second)[tmp];
        }
        suum[l]=P(tot,(*itr).first);
        l++;
    }
    sort(suum,suum+l);
    int k=1;
    for(int i=l-1;i>=0;i--){
        cout<<k<<' '<<suum[i].second<<' ';
        for(int j=0;j<N;j++){
            char tmp='A'+j;
            cout<<m[suum[i].second][tmp]<<' ';
        }
        cout<<suum[i].first<<endl;
        k++;
    }
    
    
    return 0;
}