#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
//-------------------------------------------------------

int N;
int L[30];
int T;
map<string,ll> S;
map<string,int> SS[26];
map<string,int> last;
int num[30];

int score(int A) {
	int B=++num[A];
	return (L[A]*50+(50*L[A])*10/(8+2*B));
}

void solve() {
	int i,j,k,l,r,x,y; string s; char c;
	
	cin>>N;
	FOR(i,N) cin>>L[i];
	cin>>T;
	FOR(i,T) {
		cin>>s>>c;
		last[s]=i;
		c-='A';
		x = score(c);
		S[s] += x;
		SS[c][s] += x;
	}
	
	vector<pair<ll,string>> P;
	FORR(r,S) {
		P.push_back({-r.second*10000+last[r.first],r.first});
	}
	sort(ALL(P));
	FOR(i,P.size()) {
		_P("%d %s",i+1,P[i].second.c_str());
		FOR(j,N) _P(" %d",SS[j][P[i].second]);
		_P(" %lld\n",S[P[i].second]);
	}
	
	
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n';
	FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	solve(); return 0;
}