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.
    
from collections import Counter

n = int(input())

l = [input() for _ in range(n)]

c = Counter(l)

for i in ['AC','WA','TLE','RE']:
    print(f'{i} × {c[i]}')



from collections import Counter

n = int(input())

l = [input() for _ in range(n)]

c = Counter(l)

for i in ['AC','WA','TLE','RE']:
    print(f'{i} x {c[i]}')

