#include <iostream>
#include<set>
#include<vector>
#include<map>
#include<algorithm>
using namespace std;

int n;
int l[26];
int counter[26]={};

class man
{
public:
	string name;
	int score[26];
	int allscore;
	int lasttime;
	man()
	{
		name="";
		allscore=0;
		lasttime=0;
		for(int i=0;i<26;i++)score[i]=0;
	}
	bool operator<(const man m)const
	{
		return allscore==m.allscore?lasttime<m.lasttime:allscore>m.allscore;
	}
	void print(int a)
	{
		cout<<a<<" "<<name;
		for(int i=0;i<n;i++)
		{
			cout<<" "<<score[i];
		}
		cout<<" "<<allscore<<endl;
		return;
	}
};

int main() {
	map<string,man> m;
	cin>>n;
	for(int i=0;i<n;i++)cin>>l[i];
	int t;
	cin>>t;
	string name;
	char p;
	for(int i=0;i<t;i++)
	{
		cin>>name>>p;
		double fir=(50*l[p-'A'])/(0.8+0.2*(++counter[p-'A'])-(1e-10));
		int las=int(fir)+50*l[p-'A'];
		auto it=m.find(name);
		if(it==m.end())
		{
			man in;
			in.name=name;
			in.score[p-'A']+=las;
			in.allscore+=las;
			in.lasttime=i;
			m.insert(make_pair(name,in));
		}
		else
		{
			pair<string,man> in=*it;
			in.second.score[p-'A']+=las;
			in.second.allscore+=las;
			in.second.lasttime=i;
			m.erase(name);
			m.insert(in);
		}
	}
	int count=0;
	vector<man> pri;
	pair<string,man> out;
	for(auto i:m)
	{
		out=i;
		pri.push_back(out.second);
	}
	sort(pri.begin(),pri.end());
	for(int i=0;i<pri.size();i++)pri[i].print(++count);
	return 0;
}