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

int main() {
    int n;
    cin>>n;
    int l[n];
    for (int i=0;i<n;i++)
        cin>>l[i];
    map<string,int> sum;
    map<string,int> score[n];
    map<string,int> last;
    int cnt[n]{};
    int t;
    cin>>t;
    for (int i=0;i<t;i++) {
        string name;
        char p;
        cin>>name>>p;
        int pnum=p-'A';
        cnt[pnum]++;
        int scr=50*l[pnum]+500*l[pnum]/(8+2*cnt[pnum]);
        sum[name]+=scr;
        score[pnum][name]=scr;
        last[name]=i;
    }
    vector<pair<pair<int,int>,string>> rank;
    for (auto p:sum)
        rank.push_back({{-p.second,last[p.first]},p.first});
    sort(rank.begin(),rank.end());
    for (int i=0;i<rank.size();i++) {
        cout<<i+1<<' ';
        cout<<rank[i].second<<' ';
        for (int j=0;j<n;j++)
            cout<<score[j][rank[i].second]<<' ';
        cout<<sum[rank[i].second]<<endl;
    }
    return 0;
}