package main

import (
	"bufio"
	"os"
	"strconv"
	"sort"
	"fmt"
)

func score(A, B int) int {
	return int(50 * A + (500 * A / (8 + 2 * B)))
}

type User struct {
	Score []int
	Total int
	Name  string
	Time  int
}

func main() {
	sc := NewScanner()
	N := sc.NextInt()
	L := sc.NextIntArray()
	T := sc.NextInt()

	mp := map[string]int{}
	ranks := make([]int, N)

	contestant := make(SortInterFace, 0)

	for i := 0; i < T; i++ {
		name, q := sc.Next(), sc.Next()
		p := q[0] - 'A'
		ranks[p]++
		sco := score(L[p], ranks[p])
		if v, ok := mp[name]; ok {
			contestant[v].Score[p] += sco
			contestant[v].Total += sco
			contestant[v].Time = i
		} else {
			mp[name] = len(contestant)

			l := User{Name:name, Total:0 }
			l.Score = make([]int, N)
			l.Score[p] = sco
			l.Total += sco
			l.Time = i

			contestant = append(contestant, l)
		}
	}
	sort.Sort(contestant)
	for i := 1; i <= len(contestant); i++ {
		ans := strconv.Itoa(i)
		ans += " "
		ans += contestant[i - 1].Name
		for j := 0; j < N; j++ {
			ans += " "
			ans += strconv.Itoa(contestant[i - 1].Score[j])
		}
		ans += " "
		ans += strconv.Itoa(contestant[i - 1].Total)

		fmt.Println(ans)
	}
}

type Scanner struct {
	r   *bufio.Reader
	buf []byte
	p   int
}

func NewScanner() *Scanner {
	rdr := bufio.NewReaderSize(os.Stdin, 1000)
	return &Scanner{r:rdr}
}
func (s *Scanner) Next() string {
	s.pre()
	start := s.p
	for ; s.p < len(s.buf); s.p++ {
		if s.buf[s.p] == ' ' {
			break
		}
	}
	result := string(s.buf[start:s.p])
	s.p++
	return result
}
func (s *Scanner) NextLine() string {
	s.pre()
	start := s.p
	s.p = len(s.buf)
	return string(s.buf[start:])
}
func (s *Scanner) NextInt() int {
	v, _ := strconv.Atoi(s.Next())
	return v
}
func (s *Scanner) NextInt64() int64 {
	v, _ := strconv.ParseInt(s.Next(), 10, 64)
	return v
}

func (s *Scanner) NextIntArray() []int {
	s.pre()
	start := s.p
	result := []int{}
	for ; s.p < len(s.buf) + 1; s.p++ {
		if s.p == len(s.buf) || s.buf[s.p] == ' ' {
			v, _ := strconv.ParseInt(string(s.buf[start:s.p]), 10, 0)
			result = append(result, int(v))
			start = s.p + 1
		}
	}

	return result
}
func (s *Scanner) NextInt64Array() []int64 {
	s.pre()
	start := s.p
	result := []int64{}
	for ; s.p < len(s.buf) + 1; s.p++ {
		if s.p == len(s.buf) || s.buf[s.p] == ' ' {
			v, _ := strconv.ParseInt(string(s.buf[start:s.p]), 10, 64)
			result = append(result, v)
			start = s.p + 1
		}
	}
	return result
}

func (s *Scanner) NextMap() map[int]bool {
	s.pre()
	start := s.p
	mp := map[int]bool{}
	for ; s.p < len(s.buf); s.p++ {
		if s.buf[s.p] == ' ' {
			v, _ := strconv.Atoi(string(s.buf[start:s.p]))
			mp[v] = true
			start = s.p + 1
		}
	}
	v, _ := strconv.Atoi(string(s.buf[start:s.p]))
	mp[v] = true

	return mp
}

func (s *Scanner) pre() {
	if s.p >= len(s.buf) {
		s.readLine()
		s.p = 0
	}
}
func (s *Scanner) readLine() {
	s.buf = make([]byte, 0)
	for {
		l, p, e := s.r.ReadLine()
		if e != nil {
			panic(e)
		}
		s.buf = append(s.buf, l...)
		if !p {
			break
		}
	}
}

type SortInterFace []User

func (s SortInterFace) Len() int {
	return len(s)
}
func (s SortInterFace) Less(i, j int) bool {
	if s[i].Total == s[j].Total {
		return s[i].Time < s[j].Time
	}
	return s[i].Total > s[j].Total
}
func (s SortInterFace) Swap(i, j int) {
	s[i], s[j] = s[j], s[i]
}