import sys
from itertools import combinations
from math import floor
from operator import itemgetter

def debug(x, table):
    for name, val in table.items():
        if x is val:
            print('DEBUG:{} -> {}'.format(name, val), file=sys.stderr)
            return None

def solve():
    N = int(input())
    Ls = [int(i) for i in input().split()]
    rank = [0] * N
    scores = {}

    T = int(input())

    for i in range(T):
        name, p = input().split()
        p = ord(p) - ord('A')
        rank[p] += 1

        if name not in scores:
            scores[name] = [0] * (N + 1)
        
        scores[name][p] += floor(50*Ls[p] + 50*Ls[p]/(0.8+0.2*rank[p]))
        scores[name][N] = i # last submit

    # debug(scores, locals())

    output = []

    for name, score in scores.items():
        output.append([name] + score[:-1] + [sum(score[:-1])] + [score[-1]])

    # debug(output, locals())

    output.sort(key=itemgetter(N+2))
    output.sort(key=itemgetter(N+1), reverse=True)

    for i in range(len(output)):
        print(i+1, *output[i][:-1])


if __name__ == '__main__':
    solve()