#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>

using namespace std;

typedef long long ll;

#define sz size()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(c) (c).begin(), (c).end()
#define rep(i,a,b) for(ll i=(a);i<(b);++i)
#define clr(a, b) memset((a), (b) ,sizeof(a))
#define ctos(c) string(1,c)
#define print(x) cout<<#x<<" = "<<x<<endl;

#define MOD 1000000007

int main() {
	ll n;
	cin >> n;
	ll d[30];
	rep(i, 0, n) {
		ll a;
		cin >> a;
		d[i] = a;
	}
	ll m;
	cin >> m;
	vector<string> vs;
	vector<char> vc;
	rep(i, 0, m) {
		string s;
		char c;
		cin >> s >> c;
		vs.pb(s);
		vc.pb(c);
	}
	set<string> se;
	rep(i, 0, vs.sz) {
		se.insert(vs[i]);
	}
	vector<string> vn(all(se));
	map<string, ll> ma;
	map<ll, string> ma2;
	rep(i, 0, vn.sz) {
		ma[vn[i]] = i;
		ma2[i] = vn[i];
	}
	vector<vector<ll> > v(vn.sz, vector<ll>(n, 0));
	ll s[30];
	clr(s, 0);
	ll r[4010];
	clr(r, 0);
	rep(i, 0, vs.sz) {
		ll p = ma[vs[i]];
		r[p] = i;
		ll star = d[vc[i] - 'A'];
		ll rank = s[vc[i] - 'A'] + 1;
		s[vc[i] - 'A']++;
		v[p][vc[i] - 'A'] = 50 * star + 500 * star / (8 + 2 * rank);
	}
	vector<pair<pair<ll, ll>, ll> > vv;
	rep(i, 0, v.sz) {
		ll score = 0;
		rep(j, 0, v[i].sz) {
			score += v[i][j];
		}
		vv.pb(mp(mp(-score, r[i]), i));
	}
	sort(all(vv));
	rep(i, 0, vv.sz) {
		cout << i + 1 << " " << ma2[vv[i].se] << " ";
		rep(j, 0, n) {
			cout << v[vv[i].se][j] << " ";
		}
		cout << -vv[i].fi.fi << endl;
	}
	return 0;
}