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 = list(input() for _ in range(n))
print('AC ×', s.count('AC'))
print('WA ×', s.count('WA'))
print('TLE ×', s.count('TLE'))
print('RE ×', s.count('RE'))
n = int(input())
s = list(input() for _ in range(n))
print('AC x', s.count('AC'))
print('WA x', s.count('WA'))
print('TLE x', s.count('TLE'))
print('RE x', s.count('RE'))