#include<iostream>
#include <stdlib.h>
#include <limits.h>
#include<vector>
#include <climits>
#include<algorithm>
#include <bits/stdc++.h>
#include <math.h>
#include <ctype.h>
#include <string.h>
#include <vector>
#include <deque>
#include <queue>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <string>
#include <random>
using namespace std;
#define pb push_back
#define F first
#define S second
#define um unordered_map<ll, ll>
#define endl '\n'
#define sim template < class c
#define ris return * this
#define ll long long int
#define dor > debug & operator <<
#define eni(x) sim > typename \
  enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge
{
    c b, e;
};
sim > rge<c> range(c i, c j)
{
    return rge<c> {i, j};
}
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug
{
#ifdef LOCAL
    ~debug()
    {
        cerr << endl;
    }
    eni(!=) cerr << boolalpha << i;
    ris;
}
eni(==) ris << range(begin(i), end(i));
}
sim, class b dor(pair < b, c > d)
{
    ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d)
{
    *this << "[";
    for (auto it = d.b; it != d.e; ++it)
        *this << ", " + 2 * (it == d.b) << *it;
    ris << "]";
}
#else
    sim dor(const c&)
    {
        ris;
    }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "

void solve()
{ ll n;
    cin >>n;
 string a;
 int c0=0,c1=0,c2=0,c3=0;
 for (int i=0 ;i<n;i++){
        cin<<a;
    if(a=='AC')
    {
        c0++;
    }
    else if(a=='WA'){
        c1++;
    }
    else if(a=='TLE')
    {
        c2++;
    }
    else{
        c3++;
    }
    
 }
 cout<<"AC x "<<c0;
 cout<<"WA x "<<c1;
 cout<<"TLE x "<<c2;
 cout<<"RE x "<<c3;
}


int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);

solve();


return 0;
}


