def f(n,k): return 50*n+500*n//(8+2*k)

n = int(input())
*a, = map(int,input().split())
T = int(input())

from collections import defaultdict
num = [0]*n
points = defaultdict(lambda : [0]*(n+1))
last = defaultdict(int)
for t in range(T):
    s,p = input().split()
    p = ord(p)-65
    num[p] += 1
    points[s][p] = f(a[p],num[p])
    last[s] = t

for k in points:
    points[k][-1] = sum(points[k])

for i,(tot,_,k) in enumerate(sorted([(lst[-1],-last[k],k) for k,lst in points.items()],reverse=1)):
    print(i+1,k,*points[k])