#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;

int main()
{
	int n;
	cin>>n;
	int l[30];
	for(int i=0; i<n; i++) cin>>l[i];
	int T; cin>>T;
	string name[100010];
	char p[100010];
	map<string, int> s, t;
	map<pair<string, int>, int> v;
	map<P, string> mp;
	int cnt[30]={};
	for(int i=0; i<T; i++){
		cin>>name[i]>>p[i];
		cnt[p[i]-'A']++;
		v[{name[i], p[i]-'A'}]=(int)(50*l[p[i]-'A']+50*l[p[i]-'A']/(0.8+0.2*cnt[p[i]-'A']));
		s[name[i]]+=v[{name[i], p[i]-'A'}];
		t[name[i]]=i;
	}
	for(auto p:s){
		mp[{-p.second, t[p.first]}]=p.first;
	}
	int m=0;
	for(auto &p:mp){
		m++;
		cout<<m<<" "<<p.second;
		for(int i=0; i<n; i++){
			cout<<" "<<v[{p.second, i}];
		}
		cout<<" "<<-p.first.first<<endl;
	}
	return 0;
}