#include <iostream>
#include <vector>
#include <cstdio>
#include <string>
#include <map>
#include <sstream>

using namespace std;


int pc(int a)
{
    int res = 1;
    while (a /= 10)
        ++res;
    return res;
}

int bmaxa(int a, int & b)
{
    if (a > b)
        b = a;
    return b;
}

struct team {
    int pts;
    int gg, gt;
    int won, lost, tied;
    int order;

    team(int order_)
        :pts(0),gg(0),gt(0),won(0),lost(0),tied(0), order(order_)
    {}

    bool operator<(const team &r) const {
        if(pts!=r.pts)
            return pts>r.pts;
        if(gg-gt!=r.gg-r.gt)
            return gg-gt>r.gg-r.gt;
        if(gg!=r.gg)
            return gg>r.gg;
        if(won!=r.won)
            return won>r.won;
        return order>r.order;
    }
};

int nteams;

typedef map<string, team> Map;

typedef pair<int, int> ii;
typedef map<ii, ii> Foo;

string tnames[100];

int main()
{
    while(cin>>nteams, nteams) {
        Map m;
        unsigned maxtlen=0;
        for(int i=0; i<nteams; i++) {
            cin>>tnames[i];
            if(tnames[i].size()>maxtlen)
                maxtlen=tnames[i].size();
            m.insert(make_pair(tnames[i], team(i)));
        }
        
        int ngames;
        cin>>ngames;
        Foo foo;

        for(int k=0; k<ngames; k++) {
            string tname,tname2,tmp;
            cin>>tname>>tmp>>tname2;
            cin>>tmp;

            team *t1=&m.find(tname)->second,*t2=&m.find(tname2)->second;
            int s1=tmp[0]-'0',s2=tmp[2]-'0';
            foo[make_pair(t1->order, t2->order)]=make_pair(s1,s2);
            if(s2>s1) {
                swap(t1,t2);
                swap(s1,s2);
            }
            t1->gg+=s1; t2->gt+=s1;
            t1->gt+=s2; t2->gg+=s2;
            if(s1>s2) {
                t1->pts+=3;
                t1->won++;
                t2->lost++;
            } else {
                t1->pts++;
                t2->pts++;
                t1->tied++;
                t2->tied++;
            }
        }

        puts("RESULTS:");

        stringstream str;
        str<<'+';
        for(unsigned i=0; i<maxtlen; i++)
            str<<'-';
        str<<'+';
        for(int i=0; i<nteams; i++)
            str<<"---+";
        cout<<str.str()<<endl;

        putchar('|');
        for(unsigned i=0; i<maxtlen; i++)
            putchar(' ');
        putchar('|');
        for(int i=0; i<nteams; i++) {
            cout<<tnames[i].substr(0,3);
            if(tnames[i].size()<3) {
                if(tnames[i].size()<2)
                    putchar(' ');
                putchar(' ');
            }
            putchar('|');
        }
        cout<<endl<<str.str()<<endl;

        for(int i=0; i<nteams; i++) {
            cout<<'|'<<tnames[i];
            for(unsigned j=0; j<maxtlen-tnames[i].size(); j++)
                putchar(' ');
            putchar('|');
            for(int j=0; j<nteams; j++) {
                if(i==j) {
                    cout<<" X |";
                    continue;
                }
                Foo::iterator k=foo.find(make_pair(i,j));
                if(k==foo.end()) {
                    cout<<"   |";
                    continue;
                }
                cout<<k->second.first<<':'<<k->second.second<<'|';
            }
            cout<<endl<<str.str()<<endl;
        }

        cout<<"\nSTANDINGS:\n----------\n";
        vector<team> v;
        for(Map::iterator i=m.begin(); i!=m.end(); ++i)
            v.push_back(i->second);
        sort(v.begin(), v.end());

        int max1,max2=maxtlen, max3,max4,max5,max6,max7,max8;
        max1=max3=max4=max5=max6=max7=max8=0;

        for(int i=0; i<nteams; i++) {
            bmaxa(pc(i+1), max1);
            bmaxa(pc(v[i].won+v[i].lost+v[i].tied), max3);
            bmaxa(pc(v[i].won), max4);
            bmaxa(pc(v[i].tied), max5);
            bmaxa(pc(v[i].lost), max6);
            bmaxa(pc(v[i].gg)+pc(v[i].gt)+1, max7);
            bmaxa(pc(v[i].pts), max8);
        }


        for(int i=0; i<nteams; i++) {
            printf("%*d. ", max1, i+1);
            printf("%*s ", -max2, tnames[i].c_str());
            printf("%*d ", max3, v[i].won+v[i].lost+v[i].tied);
            printf("%*d ", max4, v[i].won);
            printf("%*d ", max5, v[i].tied);
            printf("%*d ", max6, v[i].lost);
            stringstream ss;
            ss<<v[i].gg<<':'<<v[i].gt;
            printf("%*s ", max7, ss.str().c_str());
            printf("%*d\n", max8, v[i].pts);
        }
        puts("");
    }


    return 0;
}