#include<bits/stdc++.h>

using namespace std;
typedef unsigned int uint;
typedef long long int ll;
typedef unsigned long long int ull;

#define debugv(v) printf("L%d %s => ",__LINE__,#v);for(auto e:v){cout<<e<<" ";}cout<<endl;
#define debugm(m) printf("L%d %s is..\n",__LINE__,#m);for(auto v:m){for(auto e:v){cout<<e<<" ";}cout<<endl;}
#define debuga(m,w) printf("L%d %s is => ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<<endl;
#define debugaa(m,w,h) printf("L%d %s is..\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[x][y]<<" ";}cout<<endl;}
#define ALL(v) (v).begin(),(v).end()
#define BIGINT 0x7FFFFFFF
#define E107 1000000007
void printbit(int u){if(u==0)cout<<0;else{int s=0,k=0;for(;0<u;u>>=1,k++)s=(s<<1)|(u&1);for(;0<k--;s>>=1)cout<<(s&1);}}

#define TIME chrono::system_clock::now()
#define MILLISEC(t) (chrono::duration_cast<chrono::milliseconds>(t).count())

template<typename T1,typename T2>
ostream& operator <<(ostream &o,const pair<T1,T2> p){o<<"("<<p.first<<":"<<p.second<<")";return o;}

int n;

int level[30];
int solved[30];

int nquery;
int query;

int nscore=0;
vector<int> score[5000];
map<string,int> namemap;
string namemap_rev[5000];

int calc_score(int quizid){
    double rank = solved[quizid]+1;
    double s = 50*level[quizid] + 50.0/(0.8+0.2*rank)*level[quizid];
    return s;
}

int main(){
    int i,j,k,l;
    
    cin >> n;
    
    for (i=0;i<n;i++){
        scanf("%d",level+i);
    }
    cin >> nquery;
    
    string name;
    for (i=nquery;0<i;i--){
        cin.ignore();
        cin >> name;
        int id = 0;
        if (!namemap.count(name)){
            id = nscore++;
            namemap[name]=id;
            namemap_rev[id]=name;
            score[id].resize(3+n);
            score[id][2+n] = id;
        }else{
            id = namemap[name];
        }
        cin >> name;
        k = name[0]-'A';
        score[id][0]-=(calc_score(k));
        score[id][1] = (-i);
        score[id][2+k]+=(calc_score(k));
        
        
        solved[k]++;
    }
    
    sort(score,score+nscore);
    
    for (i=0;i<nscore;i++){
        cout
            << (i+1) << " "
            << namemap_rev[score[i][2+n]];
        for (j=0;j<n;j++){
            cout << " " << score[i][2+j];
        }
        cout << " " << -score[i][0];
        cout << endl;
    }
    
    return 0;
}