import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


int N;
real[] L;
int T;
string[] S, P;

class Contestant {
  string name;
  int[] scores;
  int sum;
  int last;
}

void main() {
  try {
    for (; ; ) {
      N = readInt();
      L = new real[N];
      foreach (j; 0 .. N) {
        L[j] = readReal();
      }
      T = readInt();
      S = new string[T];
      P = new string[T];
      foreach (t; 0 .. T) {
        S[t] = readToken();
        P[t] = readToken();
      }
      
      const names = S.dup.sort.uniq.array;
      const m = cast(int)(names.length);
      auto cs = new Contestant[m];
      foreach (i; 0 .. m) {
        cs[i] = new Contestant();
        cs[i].name = names[i];
        cs[i].scores = new int[N];
      }
      
      auto cnt = new int[N];
      foreach (t; 0 .. T) {
        const i = names.lowerBound(S[t]);
        const j = P[t][0] - 'A';
        ++cnt[j];
        cs[i].scores[j] = cast(int)(50 * L[j] + 5 * 50 * L[j] / (4 + cnt[j]));
        cs[i].last = t;
      }
      
      foreach (i; 0 .. m) {
        cs[i].sum = cs[i].scores.sum;
      }
      cs.sort!((a, b) => ((a.sum != b.sum) ? (a.sum > b.sum) : (a.last < b.last)));
      foreach (i; 0 .. m) {
        writefln("%s %s %s %s", i + 1, cs[i].name, cs[i].scores.to!string.replaceAll(regex(`[\[\],]`), ""), cs[i].sum);
      }
    }
  } catch (EOFException e) {
  }
}