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())
test = []
for i in range(n):
    test.append(input())
print('AC × ' + str(test.count('AC')))
print('NA × ' + str(test.count('NA')))
print('TLE × ' + str(test.count('TLE')))
print('RE × ' + str(test.count('RE')))
n = int(input())
test = []
for i in range(n):
    test.append(input())
print('AC x ' + str(test.count('AC')))
print('WA x ' + str(test.count('WA')))
print('TLE x ' + str(test.count('TLE')))
print('RE x ' + str(test.count('RE')))