import java.util.*; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); Person.size = n; int[] diffs = new int[n]; for (int i = 0; i < n; i++) { diffs[i] = sc.nextInt(); } int[] counts = new int[n]; HashMap results = new HashMap<>(); int t = sc.nextInt(); for (int i = 0; i < t; i++) { String name = sc.next(); int idx = sc.next().charAt(0) - 'A'; if (!results.containsKey(name)) { results.put(name, new Person(name)); } counts[idx]++; results.get(name).add(i, idx, (int)(50 * diffs[idx] + 50 * diffs[idx] / (0.8 + 0.2 * counts[idx]))); } Person[] persons = new Person[results.size()]; int idx = 0; for (Person p : results.values()) { persons[idx] = p; idx++; } Arrays.sort(persons); StringBuilder sb = new StringBuilder(); int order = 1; for (Person p : persons) { sb.append(order).append(" ").append(p).append("\n"); order++; } System.out.print(sb); } static class Person implements Comparable { static int size; String name; int[] scores; int sum; int last; public Person(String name) { this.name = name; scores = new int[size]; sum = 0; last = 0; } public void add(int times, int idx, int value) { sum += value; last = times; scores[idx] = value; } public int compareTo(Person another) { if (sum == another.sum) { return last - another.last; } else { return another.sum - sum; } } public String toString() { StringBuilder sb = new StringBuilder(); sb.append(name); for (int i = 0; i < size; i++) { sb.append(" ").append(scores[i]); } sb.append(" ").append(sum); return sb.toString(); } } }