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.
lis = []
n = int(input())
for i in range(n):
    p = input()
    lis.append(p)
ac = lis.count("AC")
wa = lis.count("WA")
tle = lis.count("TLE")
re = lis.count("RE")
print("AC ×",ac)
print("WA ×",wa)
print("TLE ×",tle)
print("RE ×",re)
lis = []
n = int(input())
for i in range(n):
    p = input()
    lis.append(p)
ac = lis.count("AC")
wa = lis.count("WA")
tle = lis.count("TLE")
re = lis.count("RE")
print("AC x",ac)
print("WA x",wa)
print("TLE x",tle)
print("RE x",re)
