Problem:
 Score : 200 points    Problem 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.      Constraints  1 \leq N \leq 10^5  S_i is AC , WA , TLE , or RE .         Input Input is given from Standard Input in the following format:  N  S_1  \vdots  S_N       Output 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         Sample Input 1 6
AC
TLE
AC
AC
WA
TLE      Sample Output 1 AC x 3
WA x 1
TLE x 2
RE x 0  We have 3 , 1 , 2 , and 0 test case(s) for which the verdict is AC , WA , TLE , and RE , respectively.       Sample Input 2 10
AC
AC
AC
AC
AC
AC
AC
AC
AC
AC      Sample Output 2 AC x 10
WA x 0
TLE x 0
RE x 0

Solution (Python):
N = int(input())
count_AC = 0
count_WA = 0
count_TLE = 0
count_RE = 0

for i in range(N):
    S = input()
    if('AC' == S):
        count_AC += 1
    elif('WA' == S):
        count_WA += 1
    elif('TLE' == S):
        count_TLE += 1
    else:
        count_RE += 1
        
print('AC x', count_AC)
print('WA x', count_WA)
print('TLE x', count_TLE)
print('RE x', count_RE)

Solution (Python):
n = int(input())
s_i = []
for i in range(n):
  s = input()
  s_i.append(s)

ac = s_i.count('AC')
wa = s_i.count('WA')
tle = s_i.count('TLE')
re = s_i.count('RE')

print("AC x {0}".format(ac))
print("WA x {0}".format(wa))
print("TLE x {0}".format(tle))
print("RE x {0}".format(re))

Solution (Python):
n =int(input())
list=[]
for i in range(n):
    s = input()
    list.append(s)
print('AC x '+str(list.count('AC')))
print('WA x '+str(list.count('WA')))
print('TLE x '+str(list.count('TLE')))
print('RE x '+str(list.count('RE')))

Solution (Python):
a = int(input())

ac = 0
wa = 0
tle = 0
re = 0

for i in range(a):
    s = input()

    if s == "AC":
        ac += 1
    elif s == "WA":
        wa += 1
    elif s == "TLE":
        tle += 1
    else:
        re += 1
print("AC x {0}".format(ac))
print("WA x {0}".format(wa))
print("TLE x {0}".format(tle))    
print("RE x {0}".format(re))

Solution (Python):
D =[]
N = int(input())
for i in range(N):
    S = input()
    D.append(S)
    



print("AC " + "x " + str(D.count("AC")) )
print("WA " + "x " + str(D.count("WA")) )
print("TLE "+ "x " + str(D.count("TLE")) )
print("RE " + "x " + str(D.count("RE")) )

Solution (Python):
N = int(input())
a = []
AC = 0
WA = 0
TLE = 0
RE = 0
for i in range(N):
    b = input()
    a.append(b)
for ty in range(N):
    if a[ty] == "AC":
        AC += 1
    if a[ty] == "WA":
        WA += 1
    if a[ty] == "TLE":
        TLE += 1
    if a[ty] == "RE":
        RE += 1
print("AC x " + str(AC))
print("WA x " + str(WA))
print("TLE x " + str(TLE))
print("RE x " + str(RE))

Solution (Python):
t = int(input())
hash = {'AC' :0,'WA' : 0, 'TLE' : 0, 'RE' : 0}
for i in range(t):
	s = input()
	hash[s] = hash.get(s,0)+1
for i,j in hash.items():
	print(f'{i} x {j}')

Solution (Python):
N = int(input())

ac, wa, tle, re = 0, 0, 0, 0

for i in range(N):
  S = input()
  if S=='AC':
    ac+=1
  elif S=='WA':
    wa+=1
  elif S=='TLE':
    tle+=1
  elif S=='RE':
    re+=1

print('AC x %d'%ac)
print('WA x %d'%wa)
print('TLE x %d'%tle)
print('RE x %d'%re)

Solution (Python):
N = int(input())
l = []
for i in range(N):
    s = str(input())
    l.append(s)
    
res = ['AC','WA','TLE','RE']
num = [0,0,0,0]
for i in range (N):
    for j in range(4):
        if res[j] == l[i]:
            num[j] += 1

for i in range(4):
    print(res[i] + ' x',num[i])

Solution (Python):
N = int(input())
strng = [input() for i in range(N)]

counts = [0]*4
for i in range(N):
    if strng[i] == 'AC':
        counts[0] += 1
    elif strng[i] == 'WA':
        counts[1] += 1
    elif strng[i] == 'TLE':
        counts[2] += 1
    elif strng[i] == 'RE':
        counts[3] += 1

print('AC x ' + str(counts[0]))
print('WA x ' + str(counts[1]))
print('TLE x ' + str(counts[2]))
print('RE x ' + str(counts[3]))

Solution (Python):
N=int(input())
S = [input() for i in range(N)]
C=("AC","WA","TLE","RE")

for i in C:
    print(str(i)+" x "+str(S.count(str(i))))

Solution (Python):
n = int(input())
s = [input() for i in range(n)]

ac = 0
wa = 0
tle = 0
re = 0

for i in s:
    if i == "AC":
        ac += 1
    elif i == "WA":
        wa += 1
    elif i == "TLE":
        tle += 1
    elif i == "RE":
        re += 1

print("AC" + " x " + str(ac))
print("WA" + " x " + str(wa))
print("TLE" + " x " + str(tle))
print("RE" + " x " + str(re))

Solution (Python):
n = int(input())
s = [input() for _ in range(n)]

print("AC x " + str(s.count('AC')))
print("WA x " + str(s.count('WA')))
print("TLE x " + str(s.count('TLE')))
print("RE x " + str(s.count('RE')))

Solution (Python):
N=int(input())
S=[0 for j in range(4)]
Sstr=["AC", "WA", "TLE", "RE"]
for i in range(N):
    inputS=input()
    if inputS=="AC":
        S[0]+=1
    elif inputS == "WA":
        S[1]+=1
    elif inputS == "TLE":
        S[2]+=1
    else:
        S[3]+=1
for i in range(4):
    print(Sstr[i] + " x " + str(S[i]))

Solution (Python):
from collections import Counter
n = int(input())
s = [input() for _ in range(n)]
print("AC x ",s.count('AC'))
print("WA x ",s.count('WA'))
print("TLE x ",s.count('TLE'))
print("RE x ",s.count('RE'))

Solution (Python):
N = int(input())
S=[]
for i in range(N):
    S.append(input())
AC=0
WA=0
TLE=0
RE=0


for i in S:
    if i=="AC":
        AC=AC+1
    elif i=="WA":
        WA=WA+1
    elif i=="TLE":
        TLE=TLE+1
    else:
        RE=RE+1

print("AC x "+str(AC))
print("WA x "+str(WA))
print("TLE x "+str(TLE))
print("RE x "+str(RE))

Solution (Python):
n = int(input())
s = [input() for _ in range(n)]
print('AC x', s.count('AC'))
print('WA x', s.count('WA'))
print('TLE x', s.count('TLE'))
print('RE x', s.count('RE'))

Solution (Python):
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 "+str(ac))
print("WA x "+str(wa))
print("TLE x "+str(tle))
print("RE x "+str(re))

Solution (Python):
N = int(input())
S = []
for _ in range(N):
    S.append(input())
C = [0] * 4

for i in range(N):
    Si = S[i]
    if Si[0] == 'A':
        C[0] += 1
    if Si[0] == 'W':
        C[1] += 1
    if Si[0] == 'T':
        C[2] += 1
    if Si[0] == 'R':
        C[3] += 1

print('AC x ' + str(C[0]))
print('WA x ' + str(C[1]))
print('TLE x ' + str(C[2]))
print('RE x ' + str(C[3]))

Solution (Python):
n = int(input())
s = [input() for i in range(n)]

r = s.count('AC')
y = s.count('WA')
z = s.count('TLE')
w = s.count('RE')

print('AC x ' + str(r))
print('WA x ' + str(y))
print('TLE x ' + str(z))
print('RE x ' + str(w))

Solution (Python):
N = int(input())
cn = [0]*4 
for i in range(N):
  x = input()
  if x == "AC":
    cn[0] += 1
  elif x == "WA":
    cn[1] += 1
  elif x == "TLE":
    cn[2] += 1
  elif x == "RE":
    cn[3] += 1
print("AC x",cn[0])
print("WA x",cn[1])
print("TLE x",cn[2])
print("RE x",cn[3])

Solution (Python):
from collections import Counter


def main():

    N = int(input())
    lst = []

    for _ in range(N):
        lst.extend(input().split())

    c = dict(Counter(lst))


    for i in ["AC", "WA", "TLE", "RE"]:
        c.setdefault(i, 0)
        print(f"{i} x {c[i]}")


if __name__ == '__main__':
    main()

Solution (Python):
n = int(input())

d = {'AC':0,'WA':0,'TLE':0,'RE':0}

for i in range(n):

    s = input()

    d[s] += 1

print('AC x',d['AC'])
print('WA x',d['WA'])
print('TLE x',d['TLE'])
print('RE x',d['RE'])

Solution (Python):
n = int(input())
s = []

for i in range(n):
    s.append(str(input()))

a = 0
b = 0
c = 0
d = 0

for _ in s:
    if _ == 'AC':
        a += 1
    if _ == 'WA':
        b += 1
    if _ == 'TLE':
        c += 1
    if _ == 'RE':
        d += 1

print('AC x {}'.format(a))
print('WA x {}'.format(b))
print('TLE x {}'.format(c))
print('RE x {}'.format(d))

Solution (Python):
n = int(input())
s = [''] * n
a = {'AC': 0, 'WA': 0, 'TLE': 0, 'RE': 0}

for i in range(n):
    s[i] = input()
    if s[i] == 'AC':
        a['AC'] += 1
    elif s[i] == 'WA':
        a['WA'] += 1
    elif s[i] == 'TLE':
        a['TLE'] += 1
    elif s[i] == 'RE':
        a['RE'] += 1

print('AC x ' + str(a['AC']))
print('WA x ' + str(a['WA']))
print('TLE x ' + str(a['TLE']))
print('RE x ' + str(a['RE']))

Solution (Python):
from collections import Counter

n = int(input())
lis = [input() for _ in range(n)]

cntr = dict(Counter(lis))

for key in ['AC', 'WA', 'TLE', 'RE']:
    print(key, 'x', cntr.get(key, 0))

Solution (Python):
N = int(input())
S = ["00"]
for i in range(N):
    S.append(str(input()))

print("AC x " + str(S.count('AC')))
print("WA x " + str(S.count('WA')))
print("TLE x " + str(S.count('TLE')))
print("RE x " + str(S.count('RE')))

Solution (Python):
n = int(input())

d = {}
lst = ['AC', 'WA', 'TLE', 'RE']
for i in range(n):
    s = input()
    if s in d:
        d[s] += 1
    else:
        d[s] = 1

for i in lst:
    if i in d:
        print(i, 'x', d[i])
    else:
        print(i, 'x 0')

Solution (Python):
n=int(input())
a=0
b=0
c=0
d=0
for i in range(n):
    s=input()
    a+=s.count('AC')
    b+=s.count('WA')
    c+=s.count('TLE')
    d+=s.count('RE')
print('AC x '+str(a))
print('WA x '+str(b))
print('TLE x '+str(c))
print('RE x '+str(d))

Solution (Python):
n = int(input())
s_list = [input() for _ in range(n)]

c1 = str(s_list.count('AC'))
c2 = str(s_list.count('WA'))
c3 = str(s_list.count('TLE'))
c4 = str(s_list.count('RE'))

print('AC' + ' x ' + c1)
print('WA' + ' x ' + c2)
print('TLE' + ' x ' + c3)
print('RE' + ' x ' + c4)

Solution (Python):
N = int(input())
L = [0,0,0,0]
S = N*[0]
for i in range(N):
    S[i] = input()
    if S[i]=="AC":
        L[0]+=1
    elif S[i]=="WA":
        L[1]+=1
    elif S[i]=="TLE":
        L[2]+=1
    else:
        L[3]+=1
print(f"AC x {L[0]}")
print(f"WA x {L[1]}")
print(f"TLE x {L[2]}")
print(f"RE x {L[3]}")

Solution (Python):
ac = 0
wa = 0
tle = 0
re = 0
n = int(input())

for i in range(n):
    m = input()
    if m == "AC":
        ac = ac + 1
    elif m == "WA":
        wa = wa + 1
    elif m == "TLE":
        tle = tle + 1
    elif m == "RE":
        re = re + 1

print ("AC x " + str(ac) + "\n" + "WA x " + str(wa) + "\n" + "TLE x " + str(tle) + "\n" + "RE x " + str(re))

Solution (Python):
N = int(input())
A = []

for i in range(N):
    A.append(input())

print('AC x ', A.count('AC'))
print('WA x ', A.count('WA'))
print('TLE x ', A.count('TLE'))
print('RE x ', A.count('RE'))

Solution (Python):
N = int(input())
S = []
for i in range(N):
    S.append(input())
AC = S.count("AC")
WA = S.count("WA")
TLE = S.count("TLE")
RE = S.count("RE")

print("AC x {}".format(AC))
print("WA x {}".format(WA))
print("TLE x {}".format(TLE))
print("RE x {}".format(RE))

Solution (Python):
n = int(input())
A = [input() for _ in range(n)]
a = int()
b = int()
c = int()
d = int()
for x in range(n):
    if A[x] == "AC":
        a = a+1
    elif A[x] == "WA":
        b = b+1
    elif A[x] == "TLE":
        c = c+1
    elif A[x] == "RE":
        d = d+1
print("AC x",a)
print("WA x",b)
print("TLE x",c)
print("RE x",d)

Solution (Python):
n = int(input())
s = []
for i in range(0, n):
    s.append(input())
count_AC = 0
count_WA = 0
count_TLE = 0
count_RE = 0
for j in s:
    if j == 'AC':
        count_AC += 1
    elif j == 'WA':
        count_WA += 1
    elif j == 'TLE':
        count_TLE += 1
    elif j == 'RE':
        count_RE += 1
print("AC" + " x " + str(count_AC))
print("WA" + " x " + str(count_WA))
print("TLE" + " x " + str(count_TLE))
print("RE" + " x " + str(count_RE))

Solution (Python):
n = int(input())
abc = []
for i in range(n):
    s = str(input())
    abc.append(s)

print('AC x {}'.format(abc.count('AC')))
print('WA x {}'.format(abc.count('WA')))
print('TLE x {}'.format(abc.count('TLE')))
print('RE x {}'.format(abc.count('RE')))

Solution (Python):
N = int(input())
ac=0
wa=0
tle=0
re=0


for i in range(1,N+1):
  S = input()
  
  if S == "AC":
    ac+=1
  elif S == "WA":
    wa+=1
  elif S=="TLE":
    tle+=1
  elif S=="RE":
    re+=1

print("AC x "+str(ac))
print("WA x "+str(wa))
print("TLE x "+str(tle))
print("RE x "+str(re))

Solution (Python):
N=int(input())
a = [input() for i in range(N)]
print("AC x ",a.count("AC"))
print("WA x ",a.count("WA"))
print("TLE x ",a.count("TLE"))
print("RE x ",a.count("RE"))

Solution (Python):
N = int(input())
S = [input() for i in range(N)] 
a = str(S.count('AC'))
b = str(S.count('WA'))
c = str(S.count('TLE'))
d = str(S.count('RE'))
print("AC"+" "+"x"+" "+a)
print("WA"+" "+"x"+" "+b)
print("TLE"+" "+"x"+" "+ c)
print("RE"+" "+"x"+" "+ d)

Solution (Python):
import collections
N=int(input())
S=['a']*N
for i in range(0,N):
    S[i]=input()
J=collections.Counter(S)
print('AC',J['AC'],sep=' x ')
print('WA',J['WA'],sep=' x ')
print('TLE',J['TLE'],sep=' x ')
print('RE',J['RE'],sep=' x ')

Solution (Python):
from collections import defaultdict

N = int(input())
d = defaultdict(int)
for _ in range(N):
    d[input()] += 1
for k in ['AC', 'WA', 'TLE', 'RE']:
    v = d[k]
    print(f'{k} x {v}')

Solution (Python):
N = int(input())
C = {"AC": 0, "WA": 0, "TLE": 0, "RE": 0}
for i in range(N):
    c = input()
    if c == "AC":
        C["AC"] += 1
    elif c == "WA":
        C["WA"] += 1
    elif c == "RE":
        C["RE"] += 1
    else:
        C["TLE"] += 1
print("AC x", C["AC"])
print("WA x", C["WA"])
print("TLE x", C["TLE"])
print("RE x", C["RE"])

Solution (Python):
N=int(input())
S=[input() for i in range(N)]



a=0
w=0
t=0
r=0
for s in S:
  if s=='AC':
    a+=1
  if s=='WA':
    w+=1
  if s=='TLE':
    t+=1
  if s=='RE':
    r+=1

print('AC x',a)
print('WA x',w)
print('TLE x',t)
print('RE x',r)

Solution (Python):
N = int(input())
ac = 0
wa = 0
tle = 0
re = 0
for i in range(N):
    S = input()
    if S == 'AC':
        ac += 1
    if S == 'WA':
        wa += 1
    if S == 'TLE':
        tle += 1
    if S == 'RE':
        re += 1
print('AC x',ac)
print('WA x',wa)
print('TLE x',tle)
print('RE x',re)

Solution (Python):
N=int(input())
count={'AC':0,'WA':0,'TLE':0,'RE':0}

for _ in range(N):
    count[input()]+=1

for k,v in zip(count.keys(),count.values()):
    print(k,'x',v)

Solution (Python):
n = int(input())
s = [input() for i in range(n)]
ac = 0 
wa = 0
tle = 0
re = 0

for i in s:
    if i == "AC":
        ac += 1
    elif i == "WA":
        wa += 1
    elif i == "TLE":
        tle += 1
    elif i == "RE":
        re += 1


print('AC x ', end='') 
print(ac)
print('WA x ', end='') 
print(wa)
print('TLE x ', end='') 
print(tle)
print('RE x ', end='')
print(re)

Solution (Python):
N=int(input())
a=[input() for i in range(N)]
print("AC x "+str(a.count("AC")) )
print("WA x "+str(a.count("WA")) )
print("TLE x "+str(a.count("TLE")) )
print("RE x "+str(a.count("RE")) )

Solution (Python):
from sys import stdin


def main():

    N = int(input())

    result = [0] * 4

    for _ in range(N):
        S = stdin.readline()[:-1]
        if S == 'AC':
            result[0] += 1
        elif S == 'WA':
            result[1] += 1
        elif S == 'TLE':
            result[2] += 1
        else:
            result[3] += 1

    print("AC x " + str(result[0]) + "\nWA x " + str(result[1]) + "\nTLE x " + str(result[2]) + "\nRE x " + str(result[3]))

main()

Solution (Python):
from collections import Counter
N = int(input())
S = [input() for _ in range(N)]
c = Counter(S)
ans = ['AC', 'WA', 'TLE', 'RE']
for a in ans:
    if a in c.keys():
        print(a + ' x ' + str(c[a]))
    else:
        print(a + ' x 0')

Solution (Python):
N = int(input().strip())
s = [input() for i in range(N)]
ac=0
wa=0
tle=0
re=0


for i in range(N):
    if(s[i]=="AC"):
        ac=ac+1
    elif(s[i]=="WA"):
        wa=wa+1
    elif(s[i]=="TLE"):
        tle=tle+1
    else:
        re=re+1
print("AC x "+str(ac))
print("WA x "+str(wa))
print("TLE x "+str(tle))
print("RE x "+str(re))

Solution (Python):
N = int(input())
S = [input() for i in range(N)]
ac = 0
wa = 0 
tle = 0
re = 0
for n in range(N):
    if S[n] == "AC" :
        ac = ac + 1
    elif S[n] == "WA" :
        wa = wa + 1
    elif S[n] == "TLE" :
        tle = tle + 1
    elif S[n] == "RE" :
        re = re + 1

ans1 = "AC x  " + str(ac)
ans2 = "WA x  " + str(wa)
ans3 = "TLE x  " + str(tle)
ans4 = "RE x  " + str(re)

print(ans1)
print(ans2)
print(ans3)
print(ans4)

Solution (Python):
from collections import Counter
n = int(input())
s = [input() for _ in range(n)]
c = Counter(s)
key = ['AC', 'WA', 'TLE', 'RE']
for i in key:
    for j, k in c.items():
        if i==j:
            print(i, 'x', k)
            break
    else:
        print(i, 'x', 0)

Solution (Python):
N = int(input())
li = [input() for _ in range(N)]
ac = 0
wa = 0
tle = 0
re = 0
for i in range(N):
    if li[i] == 'AC':
        ac += 1
    if li[i] == 'WA':
        wa += 1
    if li[i] == 'TLE':
        tle += 1
    if li[i] == 'RE':
        re += 1
print("AC x " + str(ac))
print("WA x " + str(wa))
print("TLE x " + str(tle))
print("RE x " + str(re))

Solution (Python):
import collections
n = int(input())
s = []
for _ in range(n):
    s.append(input())
c = collections.Counter(s)
print('AC x {}'.format(c['AC']))
print('WA x {}'.format(c['WA']))
print('TLE x {}'.format(c['TLE']))
print('RE x {}'.format(c['RE']))

Solution (Python):
N = int(input())
S = []
for _ in range(N):
    S.append(input()) 
a = S.count('AC')
b = S.count('WA')
c = S.count('TLE')
d = S.count('RE')
print ('AC x' +' ' + str(a))
print('WA x' + ' '+ str(b))
print('TLE x' +' ' + str(c))
print('RE x' + ' '+ str(d))

Solution (Python):
import sys
input = sys.stdin.buffer.readline

def main():
    n = int(input())
    s = [input() for i in range(n)]

    ac = 0
    wa = 0
    tle = 0
    re = 0

    for i in range(len(s)):
        if s[i].strip().decode() == "AC":
            ac += 1
        elif s[i].strip().decode() == "WA":
            wa += 1
        elif s[i].strip().decode() == "TLE":
            tle += 1
        else:
            re += 1

    print("AC x {}".format(str(ac)))
    print("WA x {}".format(str(wa)))
    print("TLE x {}".format(str(tle)))
    print("RE x {}".format(str(re)))

if __name__ == '__main__':
    main()

Solution (Python):
from collections import Counter
n = int(input())
c = Counter()
for i in range(n):
    s = input()
    c = c+ Counter({s : 1})
print("AC x", c["AC"])
print("WA x", c["WA"])
print("TLE x", c["TLE"])
print("RE x", c["RE"])

Solution (Python):
n=int(input())
s=[input() for i in range(n)]
print("AC x "+str(s.count("AC")))
print("WA x "+str(s.count("WA")))
print("TLE x "+str(s.count("TLE")))
print("RE x "+str(s.count("RE")))

Solution (Python):

n = int(input())
p = []
for i in range(n):
    q = input()
    p.append(q)
print("AC x "+str(p.count("AC")))
print("WA x "+str(p.count("WA")))
print("TLE x "+str(p.count("TLE")))
print("RE x "+str(p.count("RE")))

Solution (Python):
n=int(input())

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

print("AC x",s.count('AC'))
print("WA x",s.count('WA'))
print("TLE x",s.count('TLE'))
print("RE x",s.count('RE'))

Solution (Python):
N = int(input())
dictres = {'AC':0, 'WA':0, 'TLE':0, 'RE':0}
for i in range(N):
  res = input()
  if res == 'AC':
    dictres['AC'] += 1
  elif res == 'WA':
    dictres['WA'] += 1
  elif res == 'TLE':
    dictres['TLE'] += 1
  elif res == 'RE':
    dictres['RE'] += 1
for i, j in dictres.items():
  print("{} x {}".format(i, j))

Solution (Python):
from heapq import *
import sys
from collections import *
from itertools import *
from decimal import *
import copy
from bisect import *
import math
sys.setrecursionlimit(4100000)
def gcd(a,b):
    if(a%b==0):return(b)
    return (gcd(b,a%b))
input=lambda :sys.stdin.readline().rstrip()
N=int(input())
S=[input() for i in range(N)]
S=Counter(S)

for s in ["AC","WA","TLE","RE"]:
    print(s,"x",S[s])

Solution (Python):
n = int(input())
s = [input() for i in range(n)]
judge = ['AC', 'WA', 'TLE', 'RE']
count = [0, 0, 0, 0]
for x in s:
    for i in range(4):
        if x==judge[i]: count[i] += 1

for i in range(4):
    print("{} x {}".format(judge[i], count[i]))

Solution (Python):
N = int(input())
ac = 0
wa = 0
tle = 0
re = 0
for _ in range(N):
    tmp = input()
    if tmp == 'AC':
        ac += 1
    elif tmp == 'WA':
        wa += 1
    elif tmp == 'TLE':
        tle += 1
    else:
        re += 1
print('AC x ' + str(ac))
print('WA x ' + str(wa))
print('TLE x ' + str(tle))
print('RE x ' + str(re))

Solution (Python):
N=int(input())
S=[input() for _ in range(N)]

ac=S.count('AC')
wa=S.count('WA')
tle=S.count('TLE')
re=S.count('RE')

print('AC x '+ str(ac))
print('WA x '+ str(wa))
print('TLE x '+ str(tle))
print('RE x '+ str(re))

Solution (Python):
n=int(input())
a = [input() for i in range(n)]
print('AC x ',a.count('AC'))
print('WA x ',a.count('WA'))
print('TLE x ',a.count('TLE'))
print('RE x ',a.count('RE'))

Solution (Python):
from collections import defaultdict
n = int(input())
d = defaultdict(lambda: 0)

for i in range(n):
   s = input()
   d[s] += 1

for s in ['AC', 'WA', 'TLE', 'RE']:
   print(f"{s} x {d[s]}")

Solution (Python):
l = []
n = int(input())
for i in range(n):
    l.append(input())

print("AC x " + str(l.count("AC")))
print("WA x " + str(l.count("WA")))
print("TLE x " + str(l.count("TLE")))
print("RE x " + str(l.count("RE")))

Solution (Python):
n = int(input())
s = list(input() for i in range(n))

print('AC x ' + str(s.count('AC')))
print('WA x ' + str(s.count('WA')))
print('TLE x ' + str(s.count('TLE')))
print('RE x ' + str(s.count('RE')))

Solution (Python):
n = int(input())
s = [input() for i in range(n)]

ac=0
wa=0
tle=0
re=0
for x in s:
    if x == "AC":
        ac += 1
    elif x == "WA":
        wa += 1
    elif x == "TLE":
        tle += 1
    elif x == "RE":
        re += 1
        
print("AC x "+str(ac))
print("WA x "+str(wa))
print("TLE x "+str(tle))
print("RE x "+str(re))

Solution (Python):
N=int(input())
ac=0
wa=0
tle=0
re=0
for i in range(N):
    S=str(input())
    if S=='AC':
        ac+=1
    elif  S=='WA':
        wa+=1
    elif S=='TLE':
        tle+=1
    else:
        re+=1
print("AC x "+str(ac))
print("WA x "+str(wa))
print("TLE x "+str(tle))
print("RE x "+str(re))

Solution (Python):
N = int(input())
s = []
for _ in range(N):
    ver = input()
    s.append(ver)

ac = 0
wa = 0
tle = 0
re = 0

for i in range(N):
    if s[i] == 'AC':
        ac += 1
    elif s[i] == 'WA':
        wa += 1
    elif s[i] == 'TLE':
        tle += 1
    else:
        re += 1

print('AC x {}'.format(ac))
print('WA x {}'.format(wa))
print('TLE x {}'.format(tle))
print('RE x {}'.format(re))

Solution (Python):
n = int(input())
a = w = t = r = 0
for i in range(n):
    s = str(input())
    if s == "AC":
        a += 1
    elif s == "WA":
        w += 1
    elif s == "TLE":
        t += 1
    elif s == "RE":
        r += 1
print("AC x " + str(a))
print("WA x " + str(w))
print("TLE x " + str(t))
print("RE x " + str(r))

Solution (Python):
N=int(input())

AC=0
WA=0
TLE=0
RE=0

for i in range(N):
    a=input()
    if a=='AC':
        AC+=1
    if a=='WA':
        WA+=1
    if a=='TLE':
        TLE+=1
    if a=='RE':
        RE+=1
print(f'AC x {AC}')
print(f'WA x {WA}')
print(f'TLE x {TLE}')
print(f'RE x {RE}')

Solution (Python):
n = int(input())
s = [input() for i in range(n)]
ac = s.count('AC')
wa = s.count('WA')
tle = s.count('TLE')
re = s.count('RE')

print('AC x '+str(ac))
print('WA x '+str(wa))
print('TLE x '+str(tle))
print('RE x '+str(re))

Solution (Python):
n = int(input())
s = []
c1 = 0 
c2 = 0
c3 = 0
c4 = 0
for i in range(n):
    s.append(input()) 
    if s[i] == 'AC':
        c1 += 1
    elif s[i] == 'WA':
        c2 += 1
    elif s[i] == 'TLE':
        c3 += 1
    elif s[i] == 'RE':
        c4 += 1

print('AC x',c1)
print('WA x',c2)
print('TLE x',c3)
print('RE x',c4)

Solution (Python):
n=int(input())
S = [input() for i in range(n)]
ac=0
wa=0
tle=0
re=0

for s in S:
    if s=='AC':
        ac+=1
    elif s=='TLE':
        tle+=1
    elif s=='WA':
        wa+=1
    elif s=='RE':
        re+=1
print('AC x '+str(ac))
print('WA x '+str(wa))
print('TLE x '+str(tle))
print('RE x '+str(re))

Solution (Python):
n = int(input())

d = {}

d["AC"] = 0
d["WA"] = 0
d["TLE"] = 0
d["RE"] = 0

for i in range(n):
    d[input()] += 1

for k, v in d.items():
    print("{} x {}".format(k, v))

Solution (Python):
def main():
    N = int(input())
    S = [input() for _ in range(N)]

    J = ["AC", "WA", "TLE", "RE"]
    for j in J:
        c = S.count(j)
        print(j, "x", c)


if __name__ == '__main__':
    main()

Solution (Python):
N = int(input())
temp = [input() for _ in range(N)]

print("AC x {}".format(temp.count("AC")))
print("WA x {}".format(temp.count("WA")))
print("TLE x {}".format(temp.count("TLE")))
print("RE x {}".format(temp.count("RE")))

Solution (Python):
from collections import Counter
xlist = []
for _ in range(int(input())):
    xlist.append(input())

c = Counter(xlist)

print("AC x",c['AC'])
print("WA x",c['WA'])
print("TLE x",c['TLE'])
print("RE x",c['RE'])

Solution (Python):
N = int(input())
S=[]

for n in range(N):
    S.append(input())

AC ='AC x '
WA ='WA x '
TLE ='TLE x '
RE ='RE x '


print(AC + str(S.count("AC")))
print(WA + str(S.count("WA")))
print(TLE + str(S.count("TLE")))
print(RE + str(S.count("RE")))

Solution (Python):
N = int(input())
cnt_AC = 0
cnt_WA = 0
cnt_TLE = 0
cnt_RE = 0
for i in range(N):
  S = input()
  if S == 'AC':
    cnt_AC += 1
  elif S == 'WA':
    cnt_WA += 1
  elif S == 'TLE':
    cnt_TLE += 1
  else:
    cnt_RE += 1
print('AC x', cnt_AC)
print('WA x', cnt_WA)
print('TLE x', cnt_TLE)
print('RE x', cnt_RE)

Solution (Python):
N = int(input())
list = []
for i in range(N):
    s = input()
    list.append(s)

AC = str(list.count('AC'))
WA = str(list.count('WA'))
TLE = str(list.count('TLE'))
RE = str(list.count('RE'))

print('AC x '+ AC)
print('WA x '+ WA)
print('TLE x ' + TLE)
print('RE x '+ RE)

Solution (Python):
n = int(input())
l = []
i = 1
while i<=n:
    a = input()
    l.append(a)
    i+=1
print("AC x "+ str(l.count("AC")))
print("WA x "+ str(l.count("WA")))
print("TLE x "+ str(l.count("TLE")))
print("RE x "+ str(l.count("RE")))

Solution (Python):
n = int(input())

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

string_array = ["AC", "WA", "TLE", "RE"]

for i in string_array:
    print("{} x {}".format(i, input_array.count(i)))

Solution (Python):
n = int(input())
A = 0
W = 0
T = 0
R = 0
for i in range(n):
    a = input()
    if a == "AC":
        A += 1
    if a =="WA":
        W += 1
    if a == "TLE":
        T += 1
    if a == "RE":
        R += 1

print("AC x " + str(A))
print("WA x " + str(W))
print("TLE x " + str(T))
print("RE x " + str(R))

Solution (Python):
N=int(input())
S=[];Y=[0]*4
for i in range(N):
  S.append(input())


for i in range(len(S)):
  if S[i]=="AC":
    Y[0]+=1
  elif S[i]=="WA":
    Y[1]+=1
  elif S[i]=="TLE":
    Y[2]+=1
  elif S[i]=="RE":
    Y[3]+=1

print("AC x",Y[0])
print("WA x",Y[1])
print("TLE x",Y[2])
print("RE x",Y[3])

Solution (Python):
N=int(input())
t=[input() for i in range(N)]
a,b,c,d=0,0,0,0
for j in range(N):
  if t[j]=="AC":
    a+=1
  if t[j]=="WA":
    b+=1
  if t[j]=="TLE":
    c+=1
  if t[j]=="RE":
    d+=1
print("AC x",a)
print("WA x",b)
print("TLE x",c)
print("RE x",d)

Solution (Python):
mydict={'AC':0,'WA':0,'TLE':0,'RE':0}

for _ in range(0,int(input())):
    x=str(input())
    if x=='AC':
        mydict[x]+=1
    elif x=='WA':
        mydict[x]+=1
    elif x=='TLE':
        mydict[x]+=1
    elif x=='RE':
        mydict[x]+=1
       
 
        
   
print(f"AC x {mydict['AC']}")
print(f"WA x {mydict['WA']}")
print(f"TLE x {mydict['TLE']}")
print(f"RE x {mydict['RE']}")

Solution (Python):
def main():
    N = int(input())
    AC = 0
    WA = 0
    TLE = 0
    RE = 0
    for _  in range(N):
        t = input()
        if t == 'AC':
            AC += 1
        elif t == 'WA':
            WA += 1
        elif t == 'TLE':
            TLE += 1
        elif t == 'RE':
            RE += 1
    print(f"AC x {AC}")
    print(f"WA x {WA}")
    print(f"TLE x {TLE}")
    print(f"RE x {RE}")

if __name__ == '__main__':
    main()

Solution (Python):
from collections import defaultdict

n = int(input())
d = defaultdict(int)

for i in range(n):
    s = input()
    d[s] += 1

print('{} x {}'.format('AC',d['AC']))
print('{} x {}'.format('WA',d['WA']))
print('{} x {}'.format('TLE',d['TLE']))
print('{} x {}'.format('RE',d['RE']))

Solution (Python):
N = int(input())
S = [input() for _ in range(N)]

C0 = 0  
C1 = 0  
C2 = 0  
C3 = 0  

for target_str in range(N):
    if S[target_str] == "AC":
        C0 = C0 + 1
    elif S[target_str] == "WA":
        C1 = C1 + 1
    elif S[target_str] == "TLE":
        C2 = C2 + 1
    else:
        C3 = C3 + 1

print("AC x {}".format(C0))
print("WA x {}".format(C1))
print("TLE x {}".format(C2))
print("RE x {}".format(C3))

Solution (Python):
import collections
s = int(input())
a = [input() for i in range(s)]

t = collections.Counter(a)
print('AC x {}'.format(t['AC']))
print('WA x {}'.format(t['WA']))
print('TLE x {}'.format(t['TLE']))
print('RE x {}'.format(t['RE']))

Solution (Python):
import sys
import numpy as np

A = int(input())
AC = 0
WA = 0
TLE = 0
RE = 0

for i in range(A):
    s = str(input())
    if s == 'AC':
        AC += 1
    elif s == 'WA':
        WA += 1
    elif s == 'TLE':
        TLE += 1
    elif s == 'RE':
        RE += 1

print('AC x', AC)
print('WA x', WA)
print('TLE x', TLE)
print('RE x', RE)

Solution (Python):
import numpy as np

N = int(input())
S = [input() for i in range(N)]

C = np.zeros(4 , dtype = int)

C[0] = S.count('AC')
C[1] = S.count('WA')
C[2] = S.count('TLE')
C[3] = S.count('RE')

print('AC x',C[0])
print('WA x',C[1])
print('TLE x',C[2])
print('RE x',C[3])

Solution (Python):
n = input()
a = [input() for i in range(int(n))]
b = [0] * 4

for i in range(int(n)):
    if(a[i] == "AC"):
        b[0] += 1
    elif(a[i] == "WA"):
        b[1] += 1
    elif(a[i] == "TLE"):
        b[2] += 1
    elif(a[i] == "RE"):
        b[3] += 1

print("AC x ", b[0])
print("WA x ", b[1])
print("TLE x ", b[2])
print("RE x ", b[3])

Solution (Python):
N = int(input())    


C = [0,0,0,0]
for i in range(N):
    s = input()
    if s == "AC":
        C[0] += 1
    elif s == "WA":
        C[1] += 1
    elif s == "TLE":
        C[2] += 1
    else:
        C[3] += 1

print("AC x " + str(C[0]))
print("WA x " + str(C[1]))
print("TLE x " + str(C[2]))
print("RE x " + str(C[3]))

Solution (Python):
lis=[]
n=int(input())
for i in range(n):
 lis.append(str(input()))


print("AC x "+str(lis.count("AC")))
print("WA x "+str(lis.count("WA")))
print("TLE x "+str(lis.count("TLE")))
print("RE x "+str(lis.count("RE")))

Solution (Python):
N=int(input())
A=[]
for i in range(0,N):
    A.append(input())
print('AC','x',A.count('AC'))
print('WA','x',A.count('WA'))
print('TLE','x',A.count('TLE'))
print('RE','x',A.count('RE'))

Solution (Python):
n = int(input())

ans = {
  'AC': 0,
  'WA': 0,
  'TLE': 0,
  'RE': 0,
}

for i in range(n):
  inp = input()
  ans[inp] += 1
for k in ans:
  print(k, 'x', ans[k])

Solution (Python):
N = int(input())
S = []
for i in range(N):
    S.append(input())
print('AC x ' + str(S.count('AC')))
print('WA x ' + str(S.count('WA')))
print('TLE x ' + str(S.count('TLE')))
print('RE x ' + str(S.count('RE')))

Solution (Python):
from collections import defaultdict
new = defaultdict(int)
for i in range(int(input())):
    s = input()
    new[s] += 1
print("AC x "+str(new['AC']))
print("WA x "+str(new['WA']))
print("TLE x "+str(new['TLE']))
print("RE x "+str(new['RE']))