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())
a=0
b=0
c=0
d=0
for i in range(n):
  w=input()
  if w=="AC":
    a=a+1
  elif w=="TLE":
    b=b+1
  elif w=="WA":
    c=c+1
  else:
    d=d+1
print("AC "+"x "+str(a))
print("WA "+"x "+str(c))
print("TLE "+"x "+str(b))
print("TL "+"x "+str(d))


n=int(input())
a=0
b=0
c=0
d=0
for i in range(n):
  w=input()
  if w=="AC":
    a=a+1
  elif w=="TLE":
    b=b+1
  elif w=="WA":
    c=c+1
  else:
    d=d+1
print("AC "+"x "+str(a))
print("WA "+"x "+str(c))
print("TLE "+"x "+str(b))
print("RE "+"x "+str(d))

