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=0
wa=0
tle=0
re=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 %s"%ac)
print("WA x %s"%wa)
print("TLE x %s"%tle)
print("RE x %s"%re)

n=int(input())
ac=0
wa=0
tle=0
re=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 %s"%ac)
print("WA x %s"%wa)
print("TLE x %s"%tle)
print("RE x %s"%re)