#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <complex>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <bitset>
#include <ctime>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cassert>
#include <cstddef>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <sstream>
#include <fstream>
#include <chrono>
#include <random>

using namespace std;
#define REP(i, n) for (int (i) = 0; (i) < (n); (i)++)
#define FOR(i, a, b) for (int (i) = (a); (i) < (b); (i)++)
#define RREP(i, a) for(int (i) = (a) - 1; (i) >= 0; (i)--)
#define FORR(i, a, b) for(int (i) = (a) - 1; (i) >= (b); (i)--)
#define DEBUG(C) cerr << #C << " = " << C << endl;
using LL = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<LL>;
using VVL = vector<VL>;
using VD = vector<double>;
using VVD = vector<VD>;
using PII = pair<int, int>;
using PDD = pair<double, double>;
using PLL = pair<LL, LL>;
using VPII = vector<PII>;
template<typename T> using VT = vector<T>;
#define ALL(a) begin((a)), end((a))
#define RALL(a) rbegin((a)), rend((a))
#define SORT(a) sort(ALL((a)))
#define RSORT(a) sort(RALL((a)))
#define REVERSE(a) reverse(ALL((a)))
#define MP make_pair
#define FORE(a, b) for (auto &&a : (b))
#define FIND(s, e) ((s).find(e) != (s).end())
#define EB emplace_back

const int INF = 1e9;
const int MOD = INF + 7;
const LL LLINF = 1e18;

int calcScore(double star, double rank) {
    return (50.0 * star) + (50.0 * star / (0.8 + (0.2 * rank)));
}

bool comp(const tuple<int, int, string> &l, const tuple<int, int, string> &r) {
    int l1, l2, r1, r2;string l3, r3;
    tie(l1, l2, l3) = l;tie(r1, r2, r3) = r;
    if (l1 != r1) return l1 > r1;
    return l2 < r2;
}

int main(void) {
    int N; cin >> N;
    VI level(N), cnt(N, 0);
    for_each(ALL(level), [](int &e){cin >> e;});
    int T; cin >> T;
    VT<pair<string, int>> nameAndProblem(T);
    map<pair<string, int>, int> score;  //[MP(name, problemNum)] = score
    map<string, int> lastAcTime;//[name] = lastAcTime
    map<string, VI> ansScore;//[name][problemNum] = score
    REP(i, T) {
        string s, p;
        cin >> s >> p;
        nameAndProblem[i] = MP(s, p[0] - 'A');
        lastAcTime[s] = i;
        score[nameAndProblem[i]] = calcScore(level[p[0] - 'A'], ++cnt[p[0] - 'A']);
        if (!FIND(ansScore, s)) ansScore[s].resize(N, 0);
        ansScore[s][p[0] - 'A'] = score[nameAndProblem[i]];
    }
    vector<tuple<int, int, string>> ans;//<sum, lastAcTime, name>
    FORE(el, ansScore) {
        ans.EB(make_tuple(accumulate(ALL(el.second), 0), lastAcTime[el.first], el.first));
    }
    sort(ALL(ans), comp);
    REP(i, ans.size()) {
        int sum, lat;string name;
        tie(sum, lat, name) = ans[i];
        cout << i + 1 << " " << name << " ";
        FORE(e, ansScore[name]) cout << e << " ";
        cout << sum << endl;
    }
    return 0;
}