import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

F = lambda N, K: 50 * N + (250 * N) // (K + 4)
atoi = lambda a: ord(a) - ord("A")

N = int(input())
L = list(map(int, input().split()))
T = int(input())
name, P = zip(*[input().rstrip().split() for _ in range(T)])
rank = [0] * N

score = {x: [0] * (N + 1) for x in set(name)}
for time, (x, p) in enumerate(zip(name, P)):
    i = atoi(p)
    rank[i] += 1
    score[x][i] += F(L[i], rank[i])
    score[x][N] = time

score = list(score.items())
score.sort(key=lambda x: (sum(x[1][:-1]), -x[1][-1]), reverse=True)

for i, (name, point) in enumerate(score, 1):
    point.pop()
    print(i, end=" ")
    print(name, end=" ")
    print(*point, end=" ")
    print(sum(point))