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.
def main():
    n = int(input())

    s = [0 for i in range(n)]
    for i in range(n):
        s[i] = input()

    a = 0
    w = 0
    t = 0
    r = 0
    
    for i in range(n):
        if (s[i] == 'AC'):
            a += 1
        elif (s[i] == 'WA'):
            w += 1
        elif (s[i] == 'TLE'):
            t += 1
        else:
            r += 1

    print('ACx' + str(a))
    print('WAx' + str(w))
    print('TLEx' + str(t))
    print('REx' + str(r))
    
main()

def main():
    n = int(input())

    s = [0 for i in range(n)]
    for i in range(n):
        s[i] = input()

    a = 0
    w = 0
    t = 0
    r = 0
    
    for i in range(n):
        if (s[i] == 'AC'):
            a += 1
        elif (s[i] == 'WA'):
            w += 1
        elif (s[i] == 'TLE'):
            t += 1
        else:
            r += 1

    print('AC x ' + str(a))
    print('WA x ' + str(w))
    print('TLE x ' + str(t))
    print('RE x ' + str(r))
    
main()
