#include <bits/stdc++.h>
using namespace std;

#define FOR(i,l,r) for(int i = (l);i < (r);i++)
#define ALL(x) (x).begin(),(x).end()
template<typename T> bool chmax(T& a,const T& b){return a < b ? (a = b,true) : false;}
template<typename T> bool chmin(T& a,const T& b){return b < a ? (a = b,true) : false;}
typedef long long ll;

int N,T;

int get_score(int n,int k)
{
	return 50.0 * n + (int) (50.0 * n / (0.8 + 0.2 * k));
}

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

	cin >> N;
	vector<int> L(N);
	FOR(i,0,N){
		cin >> L [i];
	}
	cin >> T;
	map< string, vector<int> > mp;
	vector<int> solved(N);
	FOR(i,0,T){
		string s;
		char c;
		cin >> s >> c;
		int p_idx = c - 'A';
		if(mp.count(s) == 0){
			mp [s].assign(N + 2,{});
		}
		int score = get_score(L [p_idx],++solved [p_idx]);
		mp [s] [0] += score;
		mp [s] [1] = T - 1 - i;
		mp [s] [p_idx + 2] += score;
	}

	vector< pair< vector<int>,string > > standing;
	for(auto it : mp){
		standing.push_back(make_pair(it.second,it.first));
	}
	sort(standing.rbegin(),standing.rend());

	FOR(i,0,standing.size()){
		cout << i + 1 << " " << standing [i].second << " ";
		FOR(j,2,N + 2){
			cout << standing [i].first [j] << " ";
		}
		cout << standing [i].first.front() << endl;
	}

	return 0;
}