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())
AC,WA,TLE,RE=0,0,0,0
for i in range(n):
  s = input()
  if s =="AC":
    AC += 1
  elif s =="WA":
    WA += 1
  elif s=="TLE":
    TLE += 1
  else:
    RE += 1
print(AC,WA,TLE,RE)
n = int(input())
AC,WA,TLE,RE=0,0,0,0
for i in range(n):
  s = input()
  if s =="AC":
    AC += 1
  elif s =="WA":
    WA += 1
  elif s=="TLE":
    TLE += 1
  else:
    RE += 1
print('AC x', AC)
print('WA x', WA)
print('TLE x', TLE)
print('RE x', RE)