#include <cstdio>
#include <cmath>

#include <iostream>
#include <string>
#include <map>
#include <algorithm>

#define incID(i, l, r) for(int i = (l)    ; i <  (r); i++)
#define incII(i, l, r) for(int i = (l)    ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); i--)
#define inc( i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define dec( i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)

typedef long long   signed int LL;
typedef long long unsigned int LU;

template<typename T> void swap(T &x, T &y) { T t = x; x = y; y = t; return; }
template<typename T> T abs(T x) { return (0 <= x ? x : -x); }
template<typename T> T max(T a, T b) { return (b <= a ? a : b); }
template<typename T> T min(T a, T b) { return (a <= b ? a : b); }
template<typename T> bool setmin(T &a, T b) { if(a <= b) { return false; } else { a = b; return true; } }
template<typename T> bool setmax(T &a, T b) { if(b <= a) { return false; } else { a = b; return true; } }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }

// ---- ----

int n, l[26], t;
int ac[26], score[4000][26], time_[4000], id;
std::map<std::string, int> m;
std::map<int, std::string> r;
std::pair<int, int> pp[4000];

int main() {
	scanf("%d", &n);
	inc(i, n) { scanf("%d", &l[i]); }
	scanf("%d", &t);
	inc(i, t) {
		std::string name;
		char p;
		std::cin >> name >> p;
		
		auto it = m.find(name);
		if(it == m.end()) {
			it = (m.insert(std::make_pair(name, id))).first;
			      r.insert(std::make_pair(id, name));
			id++;
		}
		
		int i_id = it -> second;
		int prob = p - 'A';
		ac[prob]++;
		time_[i_id] = i;
		score[i_id][prob] = static_cast<int>(50 * l[prob] + (50 * l[prob]) / (0.8 + 0.2 * ac[prob]) + 0.000000001);
	}
	
	inc(i, id) {
		int sum = 0;
		inc(j, n) { sum += score[i][j]; }
		pp[i] = std::make_pair(sum * 5000 - time_[i], i);
	}
	
	std::sort(pp, pp + id);
	
	dec(i, id) {
		std::cout << (id - i) << " " << (r.find(pp[i].second)) -> second << " ";
		
		int sum = 0;
		inc(j, n) {
			int sc = score[ pp[i].second ][j];
			printf("%d ", sc);
			sum += sc;
		}
		printf("%d\n", sum);
	}
	
	return 0;
}