#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>

#define ff(i,a,b) for(int (i) = (a); (i) <= (b); ++(i))
#define fb(i,a,b) for(int (i) = (a); (i) >= (b); --(i))
#define mod 998244353
#define xx first
#define yy second
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define ll long long
#define pii pair<int,int>


using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>,rb_tree_tag, tree_order_statistics_node_update> ordered_set;/// find_by_order(x)(x+1th) , order_of_key() (strictly less)
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());



string niz[] = {"AC", "WA", "TLE", "RTE"};
map<string,int>poj;


int main()
{

    ios_base::sync_with_stdio(false); cin.tie(0);
    int t;
    cin >> t;
    while(t --){
        string x;
        cin >> x;
        poj[x]++;
    }
    ff(i,0,3){
        cout << niz[i] << " x " << poj[niz[i]] << "\n";
    }
    return 0;
}
