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)]
print('AC × %d'%S.count('AC'))
print('WA × %d'%S.count('WA'))
print('TLE × %d'%S.count('TLE'))
print('RE × %d'%S.count('RE'))
N = int(input())
S = [input() for i in range(N)]
print('AC x %d'%S.count('AC'))
print('WA x %d'%S.count('WA'))
print('TLE x %d'%S.count('TLE'))
print('RE x %d'%S.count('RE'))