#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <utility>
#include <string>
#include <map>

using namespace std;

typedef map<string, vector<int>> MSV;
typedef pair<string, vector<int>> PSV;

int f(int n, int k) {
	int ret = 50 * n + int(500.0 * n / (8 + 2 * k));
	return ret;
}

int main() {
	int n, t;
	cin >> n;

	vector<int> l(n);
	for (int i = 0; i < n; i++) {
		cin >> l[i];
	}

	cin >> t;
	string user;
	char problem_code;

	vector<int> n_ac(n, 0);
	MSV users;

	int idx_sum = n;
	int idx_last_timing = n + 1;

	for (int i = 0; i < t; i++) {
		cin >> user >> problem_code;
		int problem = problem_code - 'A';
		n_ac[problem]++;

		int point = f(l[problem], n_ac[problem]);

		auto it = users.find(user);
		if (it == users.end()) {
			vector<int> v(n + 2, 0);
			v[problem] = point;
			v[idx_sum] += point;
			v[idx_last_timing] = i;

			users[user] = v;
		} else {
			it->second[problem] = point;
			it->second[idx_sum] += point;
			it->second[idx_last_timing] = i;
		}
	}

	vector<PSV> user_vec;
	for (auto p : users) {
		user_vec.emplace_back(make_pair(p.first, p.second));
	}


	sort(user_vec.begin(), user_vec.end(),
		 [&idx_sum, &idx_last_timing](PSV &p1, PSV&p2) {
		 	if (p1.second[idx_sum] == p2.second[idx_sum]) {
		 		return p1.second[idx_last_timing] < p2.second[idx_last_timing];
		 	} else {
		 		return p1.second[idx_sum] > p2.second[idx_sum];
		 	}
		 	return true;
		 }
	);

	for (int i = 0; i < user_vec.size(); i++) {
		cout << i + 1 << " " << user_vec[i].first;
		for (int j = 0; j <= n; j++) {
			cout << " " << user_vec[i].second[j];
		}
		cout << endl;
	}

	return 0;
}