#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define mt make_tuple
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;

int f(int x, int y) {
    return 50 * x + 500 * x / (8 + 2 * y);
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int N;
    while(cin >> N) {
        vi L(N);
        rep(i, N)cin >> L[i];
        int T;
        cin >> T;

        vi cnt(N);

        map<string, vi> pts;
        rep(i, T) {
            string s;
            char p_;
            cin >> s >> p_;
            int p = p_ - 'A';
            
            if(!pts.count(s)) {
                pts[s] = vi(N + 2);
            }
            pts[s][p+2] = f(L[p], ++cnt[p]);
            pts[s][0] += pts[s][p + 2];
            pts[s][1] = -i;
        }

        vector<pair<vi, string>> v;
        each(p, pts) {
            v.emplace_back(p.second, p.first);
        }
        sort(v.rbegin(), v.rend());

        rep(i, sz(v)) {
            cout << i + 1 << ' ' << v[i].second;
            rep(j, N) {
                cout << ' ' << v[i].first[j+2];
            }
            cout << ' ' << v[i].first[0] << endl;
        }
    }
}