#include <stdio.h>
#include <string>
#include <map>
using namespace std;

#define NOT -100

int N,M;
int teams;
map<string,int> teamy;
struct _foo {char s1, s2;} v[100][100];
struct _bar {int num, games, w, t, l, gs, gg, pts; char n[105];
  bool operator<(const _bar& b) const {
    if (pts > b.pts) return true; if (pts < b.pts) return false;
    if (gs-gg > b.gs-b.gg) return true; if (gs-gg < b.gs-b.gg) return false;
    if (gs > b.gs) return true; if (gs < b.gs) return false;
    if (w > b.w) return true; if (w < b.w) return false;
    if (num > b.num) return true; 
    return false;
  }
} t[100];

int main(void) {
  while (scanf("%d", &N), N) {
    int mtlen=0;
    teamy.clear();
    teams=0;
    for (int i=0;i<N;i++) for (int j=0;j<N;j++) v[i][j].s1=NOT;
    for (int i=0;i<N;i++) {
      char l[500];
      scanf("%s", l);
      teamy.insert(pair<string, int>(l, teams));
      if (mtlen < strlen(l)) mtlen=strlen(l);
      memset(t+teams, 0, sizeof(_bar));
      strcpy(t[teams].n, l);
      t[teams].num=teams;
      teams++;
    }
    scanf("%d", &M);
    for (int i=0;i<M;i++) {
      char t1[500], t2[500]; int s1, s2;
      scanf("%s - %s %d:%d", t1, t2, &s1, &s2);
      int tn1=teamy.find(t1)->second, tn2=teamy.find(t2)->second;
      v[tn1][tn2].s1=s1; v[tn1][tn2].s2=s2;
      t[tn1].games++, t[tn2].games++;
      t[tn1].gs+=s1, t[tn1].gg+=s2,       t[tn2].gs+=s2, t[tn2].gg+=s1;
      if (s1==s2) {t[tn1].t++, t[tn1].pts++, t[tn2].t++, t[tn2].pts++; }
      else if (s1<s2) {t[tn1].l++, t[tn2].w++, t[tn2].pts+=3; }
      else {t[tn2].l++, t[tn1].w++, t[tn1].pts+=3; }	
    }
    puts("RESULTS:");
#define EL putchar('+'); for (int j=0;j<mtlen;j++) putchar('-'); putchar('+'); for (int j=0;j<N;j++) printf("---+"); putchar('\n');
    EL;
    putchar('|'); for (int j=0;j<mtlen; j++) putchar(' '); putchar('|');
    for (int i=0;i<N;i++) {  char name[10]; strncpy(name, t[i].n, 3); name[3]=0; printf("%-3s", name); putchar('|'); }  putchar('\n');
    EL;
    char fmt[100]; sprintf(fmt,"%%-%ds",mtlen);
    for (int i=0;i<N;i++) {
      putchar('|'); printf(fmt,t[i].n); putchar('|');
      for (int j=0;j<N;j++) {
	if (i==j) printf(" X ");
	else if (v[i][j].s1!=NOT) {
	  printf("%d:%d", v[i][j].s1, v[i][j].s2);
	} else printf("   ");
	putchar('|');
      }
      putchar('\n');
      EL;
    }
    puts("");

    sort(t, t+N);

    puts("STANDINGS:");
    puts("----------");

    int lens[8]={0,0,0,0,0,0,0,0};
    char fmts[8][100]; char tmp[1000];
    for (int i=0;i<N;i++) {
      for (int j=0;j<8;j++) {
	switch(j) {
	case 0: sprintf(tmp, "%d", i+1); break;
	case 1: sprintf(tmp, "%s", t[i].n); break;
	case 2: sprintf(tmp, "%d", t[i].games); break;
	case 3: sprintf(tmp, "%d", t[i].w); break;
	case 4: sprintf(tmp, "%d", t[i].t); break;
	case 5: sprintf(tmp, "%d", t[i].l); break;
	case 6: sprintf(tmp, "%d:%d", t[i].gs, t[i].gg); break;
	case 7: sprintf(tmp, "%d", t[i].pts); break;
	}
	int l=strlen(tmp);
	if (l>lens[j]) lens[j]=l;
      }
    }
    for (int j=0;j<8;j++) switch(j) {
    case 0: sprintf(fmts[j], "%%%dd. ", lens[j]); break;
    case 1: sprintf(fmts[j], "%%-%ds ", lens[j]); break;
    case 2:
    case 3:
    case 4:
    case 5: sprintf(fmts[j], "%%%dd ", lens[j]); break;
    case 6: sprintf(fmts[j], "%%%ds ", lens[j]); break;
    case 7: sprintf(fmts[j], "%%%dd\n", lens[j]); break;
    }
    for (int i=0;i<N;i++) {
      printf(fmts[0], i+1);
      printf(fmts[1], t[i].n);
      printf(fmts[2], t[i].games);
      printf(fmts[3], t[i].w);
      printf(fmts[4], t[i].t);
      printf(fmts[5], t[i].l);
      sprintf(tmp, "%d:%d", t[i].gs, t[i].gg);
      printf(fmts[6], tmp);
      printf(fmts[7], t[i].pts);
    }     
    puts("");
  }

  return 0;
}