from itertools import *
from bisect import *
# from math import *
from collections import *
from heapq import *
from random import *
from decimal import *
import numpy as np
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def MI1(): return map(int1, sys.stdin.readline().split())
def MF(): return map(float, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LF(): return list(map(float, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
dij = [(1, 0), (0, 1), (-1, 0), (0, -1)]

def main():
    n=II()
    ll=LI()
    t=II()
    qtoj={c:j for j,c in enumerate("ABCDEFGHIJKLMNOPQRSTUVWXYZ")}
    nametoi={}
    itoname=[]
    ranks=[1]*n
    cnt_name=0
    score=[]
    last=[]
    for k in range(t):
        name,q=input().split()
        if not name in nametoi:
            nametoi[name]=cnt_name
            itoname.append(name)
            cnt_name+=1
            score+=[[0]*n]
            last.append(1000000)
        i=nametoi[name]
        j=qtoj[q]
        star=ll[j]
        rank=ranks[j]
        ranks[j]+=1
        score[i][j]=50*star+250*star//(4+rank)
        last[i]=k
    hp=[]
    for i in range(cnt_name):
        heappush(hp,[-sum(score[i]),last[i],i])
    r=1
    while hp:
        s,l,i=heappop(hp)
        print(r,itoname[i],*score[i],-s)
        r+=1

main()