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.
#coding: utf-8
i = 0
AC = 0
WA = 0
TLE = 0
RE = 0
num = int(input())
print(num)
while i <num:
  line = input()
  #print(line)
  if line == "AC":
    AC += 1
  if line == "WA":
    WA += 1
  if line == "TLE":
    TLE += 1
  if line == "RE":
    RE += 1
  i += 1
print("AC x " + str(AC))
print("WA x " + str(WA))
print("TLE x " + str(TLE))
print("RE x " + str(RE))
#coding: utf-8
i = 0
AC = 0
WA = 0
TLE = 0
RE = 0
num = int(input())
#print(num)
while i <num:
  line = input()
  #print(line)
  if line == "AC":
    AC += 1
  if line == "WA":
    WA += 1
  if line == "TLE":
    TLE += 1
  if line == "RE":
    RE += 1
  i += 1
print("AC x " + str(AC))
print("WA x " + str(WA))
print("TLE x " + str(TLE))
print("RE x " + str(RE))