#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <string.h>
#include <vector>
using namespace std;

#define ll long long
#define INF (1 << 30)
#define INFLL (1LL << 60)

#define FOR(i,a,b) for(ll i = (a);i<(b);i++)
#define REP(i,a) FOR(i,0,(a))
#define MP make_pair

int n, m, star[30] = {}, howSolved[30] = {};
map<string, pair<int, int> > mp;
map<pair<string, int>, int> score;

int main() {
	cin >> n;
	for(int i = 0;i < n;i++){
		cin >> star[i];
	}
	cin >> m;
	string name;
	char solved;
	for(int i = 0;i < m;i++){
		cin >> name >> solved;
		int num = solved - 'A';
		howSolved[num]++;
		double nowSco = 50.0 * star[num] + 50.0 * star[num] / (0.8 + 0.2 * howSolved[num]);
		// cout << ";" << nowSco << endl;
		mp[name].first += nowSco;
		mp[name].second = i;
		score[MP(name, num)] = nowSco;
	}

	vector<pair<int, pair<int, string> > > data;
	map<string, pair<int, int> >::iterator it = mp.begin();
	for(;it != mp.end();it++){
		data.push_back(MP(-it->second.first, MP(it->second.second, it->first)));
	}

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

	for(int i = 0;i < data.size();i++){
		string nowName = data[i].second.second;
		cout << i + 1 << " " << nowName << " ";
		for(int j = 0;j < n;j++){
			cout << score[MP(nowName, j)] << " ";
		}
		cout << -data[i].first << endl;
	}
	return 0;
}