#define _USE_MATH_DEFINES
#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <complex>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <limits>
#include <climits>
#include <cfloat>
#include <functional>
#include <iterator>
using namespace std;

int getScore(int n, int k)
{
    return 50 * n + (500 * n) / (8 + 2 * k);
}

class Data
{
public:
    string name;
    vector<int> score;
    int sum;
    int lastSubmit;

    bool operator<(const Data& data) const
    {
        return make_pair(sum, -lastSubmit) < make_pair(data.sum, -data.lastSubmit);
    }
};

int main()
{
    int n;
    cin >> n;
    vector<int> level(n);
    for(int i=0; i<n; ++i)
        cin >> level[i];
    int t;
    cin >> t;

    vector<int> submitNum(n, 0);
    map<string, Data> data;
    for(int i=0; i<t; ++i){
        string name;
        char p;
        cin >> name >> p;
        int index = p - 'A';
        ++ submitNum[index];

        int score = getScore(level[index], submitNum[index]);

        data[name].name = name;
        data[name].score.resize(n);
        data[name].score[index] += score;
        data[name].sum += score;
        data[name].lastSubmit = i;
    }

    vector<Data> v;
    for(const auto& p : data)
        v.push_back(p.second);
    sort(v.rbegin(), v.rend());

    int rank = 0;
    for(const auto& d : v){
        ++ rank;
        cout << rank << ' ' << d.name << ' ';
        for(int i=0; i<n; ++i)
            cout << d.score[i] << ' ';
        cout << d.sum << endl;
    }

    return 0;
}