#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<vector<int>, int> P;

struct S {
	string name;
	vector<int> score;
	int sum;
	int last;

	bool operator < (const S& s) const {
		if(this->sum != s.sum) return this->sum > s.sum;
		return this->last < s.last;
	}
};

int L[26];
int R[26];

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

	int N, T;
	cin >> N;
	for(int i = 0; i < N; i++) {
		cin >> L[i];
	}
	cin >> T;

	map<string, S> m;
	for(int t = 0; t < T; t++) {
		string name;
		char p;
		cin >> name >> p;
		p -= 'A';
		if(!m.count(name)) {
			m[name].name = name;
			m[name].score = vector<int>(N);
			m[name].sum = 0;
			m[name].last = t;
		}
		R[p]++;
		int score = 50 * L[p] + int(50 * L[p] / (0.8 + 0.2 * R[p]));
		m[name].score[p] = score;
		m[name].sum += score;
		m[name].last = t;
	}

	vector<S> v;
	for(auto a : m) {
		v.push_back(a.second);
	}
	sort(v.begin(), v.end());

	for(int i = 0; i < v.size(); i++) {
		cout << i + 1 << " " << v[i].name;
		for(auto s : v[i].score) {
			cout << " " << s;
		}
		cout << " " << v[i].sum << endl;
	}
}