output_description: Let C_0, C_1, C_2, and C_3 be the numbers of test cases for which the verdict
  is `AC`, `WA`, `TLE`, and `RE`, respectively. Print the following:
  
      
      
      AC x C_0
      WA x C_1
      TLE x C_2
      RE x C_3
      
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
      S_1
      \vdots
      S_N
attempt: n = int(input())
  arr = [input() for i in range(n)]
  acnum = arr.count("AC")
  wanum = arr.count("WA")
  tlenum = arr.count("TLE")
  renum = arr.count("RE")
  print("AC x", str(acnum))
  print("WA x", str(wanum))
  print("TLE x", str(tlenum))
  print("RE x", str(renum))
  
problem_description: Statement
  
  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.
samples: [{"input": "6\n    AC\n    TLE\n    AC\n    AC\n    WA\n    TLE", "output": "AC x 3\n    WA x 1\n    TLE x 2\n    RE x 0\n    \n\nWe have 3, 1, 2, and 0 test case(s) for which the verdict is `AC`, `WA`,\n`TLE`, and `RE`, respectively.\n\n* * *"}, {"input": "10\n    AC\n    AC\n    AC\n    AC\n    AC\n    AC\n    AC\n    AC\n    AC\n    AC", "output": "AC x 10\n    WA x 0\n    TLE x 0\n    RE x 0"}]