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())
j = [0] * 4
moji = ["AC", "WA", "TLE", "RE"]
for i in range(n):
    s=input()
    if s == "AC":
        j[0] += 1
    elif s=="WA":
        j[1] += 1
    elif s=="TLE":
        j[2] += 1
    elif s == "RE":
        j[3] += 1
for k in range(4):
    print(f"{moji[k]} x {j[k]}")

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

item={"AC":0,"WA":0,"TLE":0,"RE":0}

for n in range(N):
    S=input()

    if S=="AC":
        item["AC"]+=1
    elif S=="WA":
        item["WA"]+=1
    elif S=="TLE":
        item["TLE"]+=1
    else:
        item["RE"]+=1

print("AC x",end=" ")
print(item["AC"])

print("WA x",end=" ")
print(item["WA"])

print("TLE x",end=" ")
print(item["TLE"])

print("RE x",end=" ")
print(item["RE"])

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 {}\nWA x {}\nTLE x {}\nRE x {}\n'.format(AC, WA, TLE, RE))

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

Solution (Python):
n=int(input())
a=[0]*4
b=["AC","WA","TLE","RE"]
for i in range(n):
    s=input()
    for j in range(4):
        if s == b[j]:
            a[j]+=1
for i in range(4):
    print(b[i]+" x "+str(a[i]))

Solution (Python):
count = int(input())
lists = []

for i in range(count):
  new = input()
  lists.append(new)

ac_count = lists.count('AC')
wa_count = lists.count('WA')
tle_count = lists.count('TLE')
re_count = lists.count('RE')

print("AC x " + str(ac_count))
print("WA x " + str(wa_count))
print("TLE x " + str(tle_count))
print("RE x " + str(re_count))

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

Solution (Python):
res = []

n = int(input())

for i in range(n):
    r = input()
    res.append(r)

ac = res.count("AC")
wa = res.count("WA")
tle = res.count("TLE")
re = res.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())
AC,WA,TLE,RE = 0,0,0,0

for x in range(n):
    s = input()
    if s == 'AC':
        AC = AC + 1
    elif s == 'WA':
        WA = WA + 1
    elif s == 'TLE':
        TLE = TLE + 1
    elif s == 'RE':
        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 = {"AC":0,"WA":0,"TLE":0,"RE":0}
for i in range(N):
  D[input()]+=1
for x,y in D.items():
  print("{0} x {1}".format(x,y) )

Solution (Python):
n = int(input())
result_dict = {'AC':0,'WA':0,'TLE':0,'RE':0}
for i in range(n):
    s = input()
    result_dict[s] += 1
 
print('AC'+' x '+str(result_dict['AC']))
print('WA'+' x '+str(result_dict['WA']))
print('TLE'+' x '+str(result_dict['TLE']))
print('RE'+' x '+str(result_dict['RE']))

Solution (Python):
def resolve():
    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
        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))    

resolve()

Solution (Python):
N = int(input())
S = [input() for n in range(N)]
assert len(S) == N
counts = {'AC': 0, 'WA': 0, 'TLE': 0, 'RE': 0}

for s in S:
  counts[s] += 1

for key in ['AC', 'WA', 'TLE', 'RE']:
	print('{} x {}'.format(key, counts[key]))

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 {}'.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,0,0,0
for i in range(n):
  g=input()
  if g=='AC':
    a+=1
  if g=='WA':
    w+=1
  if g=='TLE':
    t+=1
  if g=='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):
  s = input()
  if s == "AC":
    ac += 1
  elif s == "WA":
    wa += 1
  elif s == "TLE":
    tle += 1
  else:
    re += 1
print("AC","x",ac)
print("WA","x",wa)
print("TLE","x",tle)
print("RE","x",re)

Solution (Python):
N = int(input())
judge = {"AC":0, "WA":0, "TLE":0, "RE":0}
 
for _ in range(N):
    j_input = input()
    for j in judge.keys():
        if j_input == j:
            judge[j] += 1
 
for j in judge.keys():
    print(j , end = " x ")
    print(judge[j])

Solution (Python):

n = int(input())

d = {"AC":0,"WA":0,"TLE":0,"RE":0}
for _ in range(n):
    st = input()
    d[st] += 1

for x,y in d.items():
    print(x,"x",y)

Solution (Python):
dic = {'AC':0, 'WA':0, 'TLE':0, 'RE':0}
N = int(input())
for i in range(N):
  dic[input()] += 1
for i in dic:
  print(i, 'x', dic[i])

Solution (Python):
from sys import stdin

input = stdin.readline
from collections import Counter

def solve():
    n = int(input())
    verdict = [ inp for inp in stdin.read().splitlines()]
    c = Counter(verdict)
    print(f'AC x {c["AC"]}')
    print(f'WA x {c["WA"]}')
    print(f'TLE x {c["TLE"]}')
    print(f'RE x {c["RE"]}')


if __name__ == '__main__':
    solve()

Solution (Python):
N = int(input())
C = 0
D = 0
E = 0
F = 0
S = ''

for i in range(N):
    S = input()
    if S == 'AC':
        C += 1
    elif S == 'WA':
        D += 1
    elif S == 'TLE':
        E += 1
    elif S == 'RE':
        F += 1
print('AC x '+ str(C), 'WA x ' + str(D),  'TLE x ' + str(E),  'RE x ' + str(F), sep='\n')

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
    else:
        re += 1

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

Solution (Python):
N = int(input())
ans_ac = 0
ans_wa = 0
ans_tle =0
ans_re =0

for i in range(N):
    S = input()
    if S == 'AC':
        ans_ac += 1
    elif S == 'WA':
        ans_wa += 1
    elif S == 'TLE':
        ans_tle += 1
    else:
        ans_re += 1

print('AC','x',ans_ac)
print('WA','x',ans_wa)
print('TLE','x',ans_tle)
print('RE','x',ans_re)

Solution (Python):
N=int(input())
S=[input()for _ in range(N)]
from collections import*
C=Counter(S)
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())

data = [input() for _ in range(N)]

def f(s):
  c = len([x for x in data if x in s])
  print(f"{s} x {c}")
  
f("AC")
f("WA")
f("TLE")
f("RE")

Solution (Python):
N = int(input())
C = 0
D = 0
E = 0
F = 0
S = ''

for i in range(N):
    S = input()
    if S == 'AC':
        C += 1
    elif S == 'WA':
        D += 1
    elif S == 'TLE':
        E += 1
    elif S == 'RE':
        F += 1
print('AC x '+ str(C), 'WA x ' + str(D),  'TLE x ' + str(E),  'RE x ' + str(F), sep='\n')

Solution (Python):
import collections
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())

S = [""]*N

Dict={}

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


for i in range(N):
    S[i] = str(input())
    
for  j in S:
    if j in  Dict:
        temp = Dict[j]
        Dict[j] = temp + 1
    else:
        Dict[j] = 1
        
if "AC" in Dict:
    ac = Dict["AC"]
    
if "WA" in Dict:
    wa = Dict["WA"]
    
if "TLE" in Dict:
    tle = Dict["TLE"]
    
if "RE" in Dict:
    re = Dict["RE"]
    
    
print("AC x " , ac)
print("WA x " , wa)
print("TLE x " , tle)
print("RE x " , re)

Solution (Python):
n=int(input())
li=[input() for _ in range(n)]
ac=li.count("AC")
wa=li.count("WA")
tle=li.count("TLE")
re=li.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())

c = []
for i in range(n):
    c.append(input())

ac = c.count("AC")
wa = c.count("WA")
tle = c.count("TLE")
re = c.count("RE")

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

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

cA = ans.count("AC")
print(f"AC x {cA}")
cW = ans.count("WA")
print(f"WA x {cW}")
cT = ans.count("TLE")
print(f"TLE x {cT}")
cR = ans.count("RE")
print(f"RE x {cR}")

Solution (Python):
n = int(input())
l = []
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())
l = [input() for _ in range(n)]
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())
l = list()

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

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

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

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

Solution (Python):
N = int(input())
AC, WA, TLE, RE = 0,0,0,0
for _ in range(N):
  inp = input()
  
  if inp == "AC": AC += 1 
  if inp == 'WA': WA += 1 
  if inp == 'TLE': TLE += 1 
  if inp == '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())
ac=0
wa=0
tle=0
re=0
s = [input() for i in range(N)]
for i in s:
    if i == 'AC':
        ac+=1
    if i == 'WA':
        wa+=1
    if i == 'TLE':
        tle+=1
    if i == 'RE':
        re+=1
print("AC x ",ac)
print("WA x ",wa)
print("TLE x ",tle)
print("RE x ",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
  elif 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())
s = [input() for i in range(n)]
empl = [[],[],[],[]]
for i in s:
    if i == 'AC':
        empl[0].append(i)
    elif i == 'WA':
        empl[1].append(i)
    elif i == 'TLE':
        empl[2].append(i)
    else:
        empl[3].append(i)
print('AC x',len(empl[0]))
print('WA x',len(empl[1]))
print('TLE x',len(empl[2]))
print('RE x',len(empl[3]))

Solution (Python):
n=int(input())
a=[input() for i in range(n)]
b=a.count("AC")
c=a.count("TLE")
d=a.count("WA")
e=a.count("RE")
print(f"AC x {b}")
print(f"WA x {d}")
print(f"TLE x {c}")
print(f"RE x {e}")

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

C = [0] * 4
dic = ['AC', 'WA', 'TLE', 'RE']

for result in results:
    for i in range(4):
        if result == dic[i]:
            C[i] += 1
            break

for j in range(4):
    print(dic[j] + ' x ' + str(C[j]))

Solution (Python):
from collections import Counter
from typing import List

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

count = Counter(s)
'''
c0 = count['AC']
c1 = count['WA']
c2 = count['TLE']
c3 = count['RE']
'''


def ans(result: str):
    num = count[result]
    print(result, ' x ', str(int(num)))


ans('AC')
ans('WA')
ans('TLE')
ans('RE')

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

for _ in range(N):
    j_input = input()
    for j in judge.keys():
        if j_input == j:
            judge[j] += 1

for j in judge.keys():
    print(j , end = " x ")
    print(judge[j])

Solution (Python):
n = int(input())
c0, c1, c2, c3 = 0, 0, 0, 0

for i in range(n):
    s = input()
    if s == 'AC':
        c0 += 1
    elif s == 'WA':
        c1 += 1
    elif s == 'TLE':
        c2 += 1
    else:
        c3 += 1

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

Solution (Python):
n = int(input())
c0 = 0
c1 = 0
c2 = 0
c3 = 0

for i in range(n):
    s = input()
    if s == 'AC':
        c0 += 1
    elif s == 'WA':
        c1 += 1
    elif s == 'TLE':
        c2 += 1
    else:
        c3 += 1

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

Solution (Python):
def sep():
    return map(int,input().strip().split(" "))
def lis():
    return list(sep())

n=int(input())
ar=[]
for _ in range(n):
    ar.append(input())
from collections import Counter
c=Counter(ar)
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())

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

Z = 0

for i in range(N):
    Z = input()
    if Z == 'AC':
        AC += 1
    elif Z == 'WA':
        WA += 1
    elif Z == 'TLE':
        TLE += 1
    elif Z == 'RE':
        RE += 1
    else:
        continue

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

Solution (Python):
n = int(input())
c0 = 0
c1 = 0
c2 = 0
c3 = 0


for i in range(n):
    s = input()
    if s == "AC":
        c0 += 1
    if s == "WA":
        c1 += 1
    if s == "TLE":
        c2 += 1
    if s == "RE":
        c3 += 1    
        
print('AC x ',end='')
print(c0)
print('WA x ',end='')
print(c1)
print('TLE x ',end='')
print(c2)
print('RE x ',end='')
print(c3)

Solution (Python):
N = int(input())
a = 0
w = 0
t = 0
r = 0
S = []
for _ in range(N):
    S.append(str(input()))

for s in S:
    if s == 'AC':
        a += 1
    elif s == 'WA':
        w += 1
    elif s == '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))

Solution (Python):
N=int(input())
A=0
W=0
T=0
R=0
for i in range(N):
    st=input()
    if st=="AC":
        A+=1
    elif st=="WA":
        W+=1
    elif st=="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))

Solution (Python):
N=int(input())
d={"AC":0,"WA":0,"TLE":0,"RE":0}
for _ in range(N):
    d[input()]+=1
print("AC x",d["AC"])
print("WA x",d["WA"])
print("TLE x",d["TLE"])
print("RE x",d["RE"])

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

c = collections.Counter(S)

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

Solution (Python):
from collections import Counter

n = int(input())
s = [input() for _ in range(n)]
counter = Counter(s)
output = ['AC', 'WA', 'TLE', 'RE']

for key in output:
    print(f'{key} x {counter[key]}')

Solution (Python):
manage = {"AC":0,"WA":0,"TLE":0,"RE":0}
N = int(input())
for i in range(N):
    manage[str(input())] += 1

for k,v in manage.items():
    print(str(k) + " x " + str(v))

Solution (Python):
a=int(input())
count1=0
count2=0
count3=0
count4=0
for i in range(a):
    b=str(input())
    count=0
    if b=='AC':
        count1+=1 
       
    if b=='RE':
        count2+=1 
       
    if b=='TLE':
        count3+=1 
       
    if b=='WA':
        count4+=1 
print('AC x ',end='')
print(count1)
print('WA x ',end='')
print(count4)
print('TLE x ',end='')
print(count3)
print('RE x ',end='')
print(count2)

Solution (Python):
N=int(input())
ac = wa = tle = re =0
for cnt in range(N):
  S=input()
  if S=='AC':
    ac=ac+1
  elif S=='WA':
    wa=wa+1
  elif S=='TLE':
    tle=tle+1
  elif S=='RE':
    re=re+1
print('AC x '+str(ac)+'\nWA x '+str(wa)+'\nTLE x '+str(tle)+'\nRE x '+str(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())
ac_counter = 0
wa_counter = 0
tle_counter = 0
re_counter = 0
for i in range(N):
    current = input()
    if current == 'AC':
        ac_counter += 1
    if current == 'WA':
        wa_counter += 1
    if current == 'TLE':
        tle_counter += 1
    if current == "RE":
        re_counter += 1
print("AC x " + str(ac_counter))
print("WA x " + str(wa_counter))
print("TLE x " + str(tle_counter))
print("RE x " + str(re_counter))

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

a = list(input() for _ in range(N))

AC_counter = 0
WA_counter = 0
TLE_counter = 0
RE_counter = 0

for value in a:
    if value == "AC":
        AC_counter+=1
    if value == "WA":
        WA_counter+=1
    if value == "TLE":
        TLE_counter+=1
    if value == "RE":
        RE_counter+=1


print ("AC x " + str(AC_counter))
print ("WA x " + str(WA_counter))
print ("TLE x " + str(TLE_counter))
print ("RE x " + str(RE_counter))

Solution (Python):
n = int(input())
ac = 0
wa = 0
tle = 0
re = 0
for _ 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 " + 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 _ 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):
from collections import Counter
N = int(input())
C = Counter([input() for _ in range(N)])
for k in ['AC', 'WA', 'TLE', 'RE']:
    print(k, 'x', C[k])

Solution (Python):
n = int(input())
l = ["AC", "WA", "TLE", "RE"]
d = {k: 0 for k in l}
for _ in range(n):
    s = input()
    d[s] += 1
for k in l:
    print("{} x {}".format(k, d[k]))

Solution (Python):
n = int(input())
ACs = 0
WAs = 0
TLEs = 0
REs = 0
for i in range(n):
  result = input()
  if result == "AC":
    ACs += 1
  elif result == "WA":
    WAs += 1
  elif result == "TLE":
    TLEs += 1
  else:
    REs += 1
print("AC x " + str(ACs))
print("WA x " + str(WAs))
print("TLE x " + str(TLEs))
print("RE x " + str(REs))

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

Solution (Python):
listSi = [0,0,0,0]
ic = int(input())
icz = 0
while True:
  icz += 1
  i = input()
  if i == "AC":
    listSi[0] += 1
  elif i == "WA":
    listSi[1] += 1
  elif i == "TLE":
    listSi[2] += 1
  elif i == "RE":
    listSi[3] += 1
  if icz == ic:
    break
print(f"AC x {listSi[0]}")
print(f"WA x {listSi[1]}")
print(f"TLE x {listSi[2]}")
print(f"RE x {listSi[3]}")

Solution (Python):
def main():

    d = {'AC': 0, 'WA': 0, 'TLE': 0, 'RE': 0}
    N = int(input())
    for _ in range(N):
        S = input()
        d[S] += 1

    for s in ['AC', 'WA', 'TLE', 'RE']:
        print(s + ' x ' + str(d[s]))

if __name__ == '__main__':
    main()

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

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

for i in l:
    if i == 'AC':
        ac += 1
    if i == 'WA':
        wa += 1
    if i == 'TLE':
        tle += 1
    if 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):
from collections import defaultdict
n=int(input())
dic=defaultdict(int)
for i in range(n):
    dic[input()]+=1
print("AC x",dic["AC"])
print("WA x",dic["WA"])
print("TLE x",dic["TLE"])
print("RE x",dic["RE"])

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

Solution (Python):
n=int(input())
a,b,c,d=0,0,0,0
for i in range(n):
  A=input()
  if A=='AC':
    a+=1
  elif A=='WA':
    b+=1
  elif A=='TLE':
    c+=1
  elif A=='RE':
    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 _ in range(N):
  S.append(input())
li = ["AC", "WA", "TLE", "RE"]
for s in li:
  print("{0} x {1}".format(s, S.count(s)))

Solution (Python):

if __name__ == '__main__':
    N = int(input())
    DIC = {'AC': 0, 'WA': 0, 'TLE': 0, 'RE': 0}
    for _ in range(N):
        S = input()
        DIC[S] += 1

    for k, v in DIC.items():
        print(f'{k} x {v}')

Solution (Python):
n = int(input())
c0 = 0
c1 = 0
c2 = 0
c3 = 0
for i in range(n):
    c = input()
    if c == 'AC':
        c0 += 1
    elif c == 'WA':
        c1 += 1
    elif c == 'TLE':
        c2 += 1
    else:
        c3 += 1
print(f'AC x {c0}')
print(f'WA x {c1}')
print(f'TLE x {c2}')
print(f'RE x {c3}')

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())

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 ' + str(AC))
print('WA x ' + str(WA))
print('TLE x ' + str(TLE))
print('RE x ' + str(RE))

Solution (Python):
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
from collections import Counter
def main():
    n = int(input())
    d1 = {'AC':0, 'WA':0, 'TLE': 0,'RE':0}
    s = []
    for _ in range(n):
        s.append(input())
    sa = Counter(s)
    for k, v in sa.items():
        d1[k] += v
    print('AC x', d1['AC'])
    print('WA x', d1['WA'])
    print('TLE x', d1['TLE'])
    print('RE x', d1['RE'])

if __name__ == '__main__':
    main()

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", ac)
print("WA x", wa)
print("TLE x" , tle)
print("RE x" , 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 {}".format(ac))
print("WA x {}".format(wa))
print("TLE x {}".format(tle))
print("RE x {}".format(re))

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

count_list = [0] * 4

for i in range(n):
    text = input()
    if text == "AC":
        count_list[0] += 1
    elif text == "WA":
        count_list[1] += 1
    elif text == "RE":
        count_list[3] += 1
    else:
        count_list[2] += 1

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

Solution (Python):
N = int(input())
C0 = C1 = C2 = C3 = 0
for _ in range(N):
    S = input()
    if S == "AC":
        C0 += 1
    elif S == "WA":
        C1 += 1
    elif S == "TLE":
        C2 += 1
    elif S == "RE":
        C3 += 1

print("AC x %d"%C0)
print("WA x %d"%C1)
print("TLE x %d"%C2)
print("RE x %d"%C3)

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 s == "AC":
        count_ac += 1
    elif s == "WA":
        count_wa += 1
    elif s == "TLE":
        count_tle += 1
    elif s == "RE":
        count_re += 1

s1 = "AC x " + str(count_ac)
s2 = "WA x " + str(count_wa)
s3 = "TLE x " + str(count_tle)
s4 = "RE x " + str(count_re)

print(s1)
print(s2)
print(s3)
print(s4)

Solution (Python):
n = int(input())
AC = 0
TLE = 0
WA = 0
RE = 0
for i in range (0, n):
    a = input()

    if a == "AC":
        AC += 1
    elif a == "TLE":
        TLE += 1
    elif a == "WA":
        WA += 1
    elif a == "RE":
        RE += 1

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

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

c0=0
c1=0
c2=0
c3=0
for i in range(n):
  Sn=input()
  if Sn=="AC":
    c0+=1
  elif Sn=="WA":
    c1+=1
  elif Sn=="TLE":
    c2+=1
  elif Sn=="RE":
    c3+=1
 
print("AC x "+(str(c0)))
print("WA x "+(str(c1)))
print("TLE x "+(str(c2)))
print("RE x "+(str(c3)))

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 {0}\nWA x {1}\nTLE x {2}\nRE x {3}".format(ac, wa, tle, re))

Solution (Python):

a,b,c,d = 0,0,0,0
n = int(input())
s=[None]*n
for i in range(n):
	s[i] = input()
for i in range(n):
	if("AC" in s[i]):
		a+=1
	elif("WA" in s[i]):
		b+=1
	elif("TLE" in s[i]):
		c+=1
	elif("RE" in s[i]):
		d+=1
print(f"AC x {a}")
print(f"WA x {b}")
print(f"TLE x {c}")
print(f"RE x {d}")

Solution (Python):
n = int(input())
dic = {"AC":0, "WA":0, "TLE":0, "RE":0}
for i in range(n):
  s = input()
  dic[s] += 1
print("AC x " + str(dic["AC"]))
print("WA x " + str(dic["WA"]))
print("TLE x " + str(dic["TLE"]))
print("RE x " + str(dic["RE"]))

Solution (Python):
N = int(input())
A = [input() for _ in range(N)]
count = [0] * 4
for a in A:
  if a == 'AC':
    count[0] += 1
  elif a == 'WA':
    count[1] += 1
  elif a == 'TLE':
    count[2] += 1
  else:
    count[3] += 1

print(f"AC x {count[0]}")
print(f"WA x {count[1]}")
print(f"TLE x {count[2]}")
print(f"RE x {count[3]}")

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

lst = [S.count('AC'), S.count('WA'), S.count('TLE'),
S.count('RE')]
 
print('AC x ' + str(lst[0]))
print('WA x ' + str(lst[1]))
print('TLE x ' + str(lst[2]))
print('RE x ' + str(lst[3]))

Solution (Python):
n = int(input())
x1 = 0
x2 = 0
x3 = 0
x4 = 0
for i in range(n):
    s = input()
    if s == "AC":
        x1 += 1
    elif s == "WA":
        x2 += 1
    elif s == "TLE":
        x3 += 1
    elif s == "RE":
        x4 += 1
print("AC x", x1)
print("WA x", x2)
print("TLE x", x3)
print("RE x", x4)

Solution (Python):
N = int(input())
ac = 0
wa = 0
re = 0
tle = 0
for i in range(N):
    s = input()
    if s=="AC":
        ac += 1
    elif s=="WA":
        wa += 1
    elif s=="RE":
        re += 1
    elif s=="TLE":
        tle += 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())
c = [0]*4
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 ',c[0])
print('WA x ',c[1])
print('TLE x ',c[2])
print('RE x ',c[3])

Solution (Python):
N = int(input())
n = 1
S = []
while n <= N:
    s = str(input())
    S.append(s)
    n += 1

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):
def main():
    from sys import stdin

    readline = stdin.readline

    N = int(readline().rstrip())
    
    c0 , c1 , c2 , c3 = 0 , 0 , 0 , 0

    for i in range(N):
        test = readline().rstrip()

        if test == "AC":
            c0 += 1
        elif test == "WA":
            c1 += 1
        elif test == "TLE":
            c2 += 1
        elif test == "RE":
            c3 += 1

    c0 = "AC x " + str(c0)
    c1 = "WA x " + str(c1)
    c2 = "TLE x " + str(c2)
    c3 = "RE x " + str(c3)


    print(c0 + "\n" + c1 + "\n" + c2 + "\n" + c3)

main()

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

c0 = 0
c1 = 0
c2 = 0
c3 = 0

for i in range(N):
    s = input()
    if s == 'AC':
        c0 += 1
    elif s == 'WA':
        c1 += 1
    elif s == 'TLE':
        c2 += 1
    elif s == 'RE':
        c3 += 1

print('AC x {}\nWA x {}\nTLE x {}\nRE x {}'.format(c0, c1, c2, c3))

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

AC_counter = 0
WA_counter = 0
TLE_counter = 0
RE_counter = 0

for i in range(N):

    S = str(input())

    if S == 'AC':
        AC_counter += 1
    elif S == 'WA':
        WA_counter += 1
    elif S == 'TLE':
        TLE_counter += 1
    elif S == 'RE':
        RE_counter += 1


print('AC x ' + str(AC_counter))
print('WA x ' + str(WA_counter))
print('TLE x ' + str(TLE_counter))
print('RE x ' + str(RE_counter))

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

result = {}
result["AC"] = 0
result["WA"] = 0
result["TLE"] = 0
result["RE"] = 0

for i in range(N):
    judge = input()
    result[judge] += 1

for key, value in result.items():
    print(f"{key} x {value}")

Solution (Python):
n = int(input())
a = 0
w = 0
t = 0
r = 0
for i in range(n):
  s = input()
  if s == 'AC':
    a+=1
  elif s =='WA':
    w +=1
  elif s =='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))

Solution (Python):
N=input()
n=int(N)
a=0
w=0
t=0
r=0
for j in range(n):
  c=input()
  if c=='AC':
    a+=1
  elif c=='WA':
    w+=1
  elif c=='TLE':
    t+=1
  elif c=='RE':
    r+=1
print('AC x {}'.format(a))
print('WA x {}'.format(w))
print('TLE x {}'.format(t))
print('RE x {}'.format(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
    elif s == 'WA':
        wa += 1
    elif s == 'TLE':
        tle += 1
    else:
        re += 1
t = [ac, wa, tle, re]        
for i in range(4):
    if i == 0:
        print('AC x ' + str(ac))
    if i == 1:
        print('WA x ' + str(wa))                    
    
    if i == 2:
        print('TLE x ' + str(tle))
    if i == 3:
        print('RE x ' + str(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())
k=[]
for i in(range(n)):
  k.append(str(input()))
ac=k.count('AC')
wa=k.count('WA')
tle=k.count('TLE')
re=k.count('RE')
print('AC x',ac)
print('WA x',wa)
print('TLE x',tle)
print('RE x',re)