import sequtils,algorithm,math,tables,sugar
import sets,intsets,queues,heapqueue,bitops,strutils
template times*(n:int,body) = (for _ in 0..<n: body)
template `max=`*(x,y) = x = max(x,y)
template `min=`*(x,y) = x = min(x,y)

proc getchar_unlocked():char {. importc:"getchar_unlocked",header: "<stdio.h>" .}
proc scan(): int =
  while true:
    let k = getchar_unlocked()
    if k < '0': break
    result = 10 * result + k.ord - '0'.ord

proc calcScore(star:int,ac:int):int = 50 * star + (50 * star) * 5 div (4 + ac)

let n = scan()
let L = newSeqWith(n,scan())
var AC = newSeqWith(n,1)
var scores = newSeqWith(n,initTable[string,int]()) # id -> name -> score
var names = initSet[string]()
var lastSubmits = initTable[string,int]()
for i in 0..<scan():
  let S = stdin.readLine().split()
  let (name,pID) = (S[0],S[1][0].ord - 'A'.ord)
  let score = calcScore(L[pID],AC[pID])
  names.incl name
  scores[pID][name] = score
  AC[pID] += 1
  lastSubmits[name] = i
let results = toSeq(names.items).map(
  proc(name:string) : tuple[name:string,scores:seq[int],sum:int] =
    let myScores = scores.mapIt(if name in it: it[name] else: 0)
    return (name,myScores,myScores.sum())
).sorted((x,y) => (
  if x.sum != y.sum: -x.sum + y.sum else:
  lastSubmits[x.name] - lastSubmits[y.name]))
for i,r in results:
  let (name,S,sum) = r
  stdout.write i+1," ",name," "
  for s in S: stdout.write s," "
  echo sum