#include <bits/stdc++.h>

using namespace std;

#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)
#define unless(p) if(!(p))
#define until(p) while(!(p))

using ll = long long;
using P = std::tuple<int,int>;

const int dx[8] = {-1, 1, 0, 0, -1, -1, 1, 1}, dy[8] = {0, 0, -1, 1, -1, 1, -1, 1};

int N;
int levels[30], s_cnt[30];
map<string, P> _m;
map<string, vector<P> > _m2;

int score(int pid){
    return 50 * levels[pid] + 500 * levels[pid] / (8 + 2 * ++s_cnt[pid]);
}

int main(){
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    std::cin >> N;

    for(int i=0;i<N;++i){
        std::cin >> levels[i];
    }

    int T;
    std::cin >> T;
    
    for(int i=0;i<T;++i){
        string name;
        char problem;

        std::cin >> name >> problem;

        int pid = problem - 'A';
        int sc = score(pid);
        int s;
        tie(s, ignore) = _m[name];
        _m[name] = std::make_tuple(s + sc, i);
        _m2[name].emplace_back(pid, sc);
    }

    vector<tuple<int, int, string> > v;
    for(const auto &p : _m){
        v.emplace_back(-fst(p.second), snd(p.second), p.first);
    }

    sort(v.begin(), v.end());

    int M = v.size();
    for(int i=0;i<M;++i){
        string name;
        int sum;
        tie(sum, ignore, name) = v[i];
        sum = -sum;
        
        std::cout << (i + 1) << " " << name;
        sort(_m2[name].begin(), _m2[name].end());

        for(int i=0,j=0;i<N;++i){
            while(j < _m2[name].size() && fst(_m2[name][j]) < i){
                ++j;
            }

            int sc = 0;
            if(j < _m2[name].size() && fst(_m2[name][j]) == i){
                sc = snd(_m2[name][j]);
            }

            std::cout << " " << sc;
        }

        std::cout << " " << sum << std::endl;
    }
}