#include <iostream>
#include <string>
#include <stdexcept>
#include <vector>
#include <algorithm>
#include <map>
using namespace std;

int formula(int star,int n){
    return 50*star + 50*star/(0.8 + 0.2 * n);
}

class par{
public:
    string name;
    int updata;
    int p;
    
    par(string n,int u,int point){
        name = n;
        updata = u;
        p = point;
    }
};

int main(void){
    // Here your code !
    int n;
    cin >> n;
    vector<int> star(n);
    vector<int> ac(n,1);
    for(int i = 0; i < n; i++) cin >> star[i];
    
    map<string,vector<int>> number;
    map<string,int> updata;
    
    int t;
    cin >> t;
    
    for(int i = 0; i < t; i++){
        string s;
        char a;
        cin >> s;
        cin >> a;
        a -= 'A';
        if(number[s].size() == 0) number[s] = vector<int>(n,0);
        number[s][a] = formula(star[a],ac[a]++);
        updata[s] = i;
    }
    
    //最終順位付け
    
    vector<par> rank;
    
    for( auto i = number.begin() ; i != number.end() ; i++){
        int tmp = 0;
        for(int j = 0; j < n; j++)
            tmp += i->second[j];
        
        rank.push_back(par(i->first,updata[i->first],tmp));
    }
    
    sort(rank.begin(),rank.end(),[](const par& a,const par& b){
        return a.p == b.p ? a.updata < b.updata : a.p > b.p;
    });
    
    for(int i = 0; i < rank.size(); i++){
        cout << i+1 << " " << rank[i].name << " ";
        for(int j = 0; j < n; j++)cout << number[rank[i].name][j] << " ";
        cout << rank[i].p << endl;
    }
    
}