#pragma GCC target("avx2")
#pragma GCC optimize("03")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std; typedef long double ld; typedef long long ll;
typedef unsigned long long ull;
#define endl "\n"
#define FOR(i,a,b) for(int i=(a);i<=(b);i++)
#define rep(i,n) for(int i=0;i<(n);i++)
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define ALL(x) (x).begin(), (x).end()
constexpr int INF=1<<30; constexpr ll LINF=1LL<<60; constexpr ll mod=1e9+7; constexpr int NIL = -1;
template<class T>vector<T> vec(int len, T elem) { return vector<T>(len, elem); } // auto dp = vec(52, vec(103, vec(103, INF)));
template<class T>inline bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>inline bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
template<class T>inline int popcount(T a) {return __builtin_popcount(a);}
template<class T>inline T emod(T a, T p) { return (a%p + p) % p;}
//-------------------
int main() {
    cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(15);
    int n; cin >> n;
    vector<int> L(27, 0);
    vector<int> solved(27, 0);
    map<string, int> updated;
    map<string, vector<int>> mp;
    rep(i, n) {
        cin >> L[i];
    }

    auto f = [&](int i, int num) {
        return 50 * L[i] + 5 * 50 * L[i] / (4 + num);
    };
    int T; cin >> T;

    rep(_, T) {
        string name; char P; cin >> name >> P;
        if(mp[name].size()==0) mp[name].assign(27, 0);
        updated[name] = _;
        solved[P-'A']++;
        mp[name][P-'A'] = f(P-'A', solved[P-'A']);
    }

    // for(auto [k,v]: updated) {
    //     cout << k << " " << v << endl;
    // }

    vector<string> names;
    map<string, int> sm;
    for(auto [k, v]: mp) {
        names.push_back(k);
        int tmp = 0;
        for(int e: v) tmp += e;
        sm[k] = tmp;
    }

    sort(ALL(names), [&](const auto& l, const auto& r) {
        if(sm[l] != sm[r]) return sm[l] > sm[r];
        else return updated[l] < updated[r];
    });

    for(int i=0; i<names.size(); i++) {
        cout << i+1 << " " << names[i] << " ";
        rep(j, n) {
            cout << mp[names[i]][j] << " ";
        }
        cout << sm[names[i]] << endl;
    }
    return 0;
}