Takahashi is participating in a programming contest called AXC002, and he has just submitted his code to Problem A.  The problem has N test cases.  For each test case i (1\leq i \leq N), you are given a string S_i representing the verdict for that test case. Find the numbers of test cases for which the verdict is `AC`, `WA`, `TLE`, and `RE`, respectively.  See the Output section for the output format.
n = int(input())
s = [input()for i in range(n)]

a = s.count("AC")
w = s.count("WA")
t = s.count("TLE")
r = s.count("RE")

print(f'AC × {a}')
print(f'WA × {w}')
print(f'TLE × {t}')
print(f'RE × {r}')

from collections import Counter

n = int(input())
s = [input() for _ in range(n)]
counter = Counter(s)
output = ['AC', 'WA', 'TLE', 'RE']

for key in output:
    print(f'{key} x {counter[key]}')