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())
d={'AC':0,'WA':0,'TLE':0,'RE':0}
for _ in range(N):
    Si = input()
    d[Si] +=1
for k in d:
    print('{} x {}'.format(k,d[k]))

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

a={}
a['AC']=0
a['WA']=0
a['TLE']=0
a['RE']=0
for n in range(N):
    s=input()
    a[s]+=1

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

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

Solution (Python):
N=int(input())
keys=['AC','WA','TLE','RE']
result = { 'AC':0,'TLE':0,'WA':0,'RE':0 }

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

for k in keys:
  print('{} x {}'.format(k,result[k]))

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

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

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

Solution (Python):
import sys
read = sys.stdin.read
readline = sys.stdin.buffer.readline
from collections import defaultdict
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7

def main():
    N = int(readline())
    d = defaultdict(int)
    for _ in range(N):
        c = readline().decode('utf-8').strip()
        d[c]+=1
    d['AC'] += 0
    d['WA'] += 0
    d['TLE'] += 0
    d['RE'] += 0

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

if __name__ == '__main__':
    main()

Solution (Python):
from collections import defaultdict

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

Solution (Python):
n = int(input())
result = [0]*4
for i in range(n):
    r = input()
    if r == 'AC':
        result[0] += 1
    elif r == 'WA':
        result[1] += 1
    elif r == 'TLE':
        result[2] += 1
    elif r == 'RE':
        result[3] += 1

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

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


ac,wa,tle,re = 0,0,0,0
for i in l:
    if i == 'AC':
        ac += 1
    elif i == 'WA':
        wa += 1
    elif i =='TLE':
        tle += 1
    elif 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):
    tmp=input()
    if tmp == 'AC':
        ac += 1
    if tmp == 'WA':
        wa += 1
    if tmp == 'TLE':
        tle += 1
    if tmp == '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())
l = [0, 0, 0, 0]


for i in range(n):
  s = input()
  if s == 'AC':
    l[0] += 1
  elif s == 'WA':
    l[1] += 1
  elif s == 'TLE':
    l[2] += 1
  else:
    l[3] += 1

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

Solution (Python):
n = int(input())
lis  = [0] * 4
for i in range(n):
    a = input()
    if a == "AC":
        lis[0] += 1
    elif a == "WA":
        lis[1] += 1
    elif a == "TLE":
        lis[2] += 1
    elif a == "RE":
        lis[3] += 1

tmp = ["AC x", "WA x", "TLE x", "RE x"]

for i in range(4):
    print(tmp[i], lis[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
    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
    elif s == "RE":
        re += 1

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

Solution (Python):
from collections import Counter
n = int(input())

S = [input() for i in range(n)]
S = Counter(S)

li = ['AC', 'WA', 'TLE', 'RE']

for i in li:
    if S.get(i):
        print(i+' x '+str(S[i]))
    else:
        print(i+' x '+str(0))

Solution (Python):
from collections import Counter
N=int(input())
S=[input() for i in range(N)]
if 'AC' in S:
    print('AC','x',Counter(S)['AC'])
else:
    print('AC','x',0)
if 'WA' in S:
    print('WA','x',Counter(S)['WA'])
else:
    print('WA','x',0)
if 'TLE' in S:
    print('TLE','x',Counter(S)['TLE'])
else:
    print('TLE','x',0)
if 'RE' in S:
    print('RE','x',Counter(S)['RE'])
else:
    print('RE','x',0)

Solution (Python):
n = int(input())
l = [0]*4

for i in range(n):
    a = str(input())
    if a == "AC":
        l[0] += 1
    elif a == "WA":
        l[1] += 1
    elif a == "TLE":
        l[2] += 1
    else:
        l[3] += 1

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

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


ResList=[0,0,0,0]

for i in Stringlist:
  if i=='AC':
    ResList[0]+=1
  elif i=='WA':
    ResList[1]+=1
  elif i=='TLE':
    ResList[2]+=1
  else:
    ResList[3]+=1
    
print("AC x "+str(ResList[0]))
print("WA x "+str(ResList[1]))
print("TLE x "+str(ResList[2]))
print("RE x "+str(ResList[3]))

Solution (Python):
ac,tle,wa,re=0,0,0,0
for _ in range(int(input())):
  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())
ls = [input() for _ in range(n)]

nac = 0
nwa = 0
ntle = 0
nre = 0

for s in ls:
    if s == "AC":
        nac += 1
    elif s == "WA":
        nwa += 1
    elif s == "TLE":
        ntle += 1
    else:
        nre += 1

print(f"AC x {nac}\n\
WA x {nwa}\n\
TLE x {ntle}\n\
RE x {nre}")

Solution (Python):
N = int(input())
txt = ["AC","WA","TLE","RE"]
ans = [0] * 4
for _ in range(N):
    S = input()
    for i in range(4):
        if S == txt[i]:
            ans[i] = ans[i] + 1
for i in range(4):
    print(txt[i] + " x " + str(ans[i]))

Solution (Python):



def main():
    n = int(input())
    s = ""
    for i in range(n):
        s += 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')))

if __name__ == '__main__':
    main()

Solution (Python):
n = int(input())
s = [input() for i in range(n)]
c = [0 for i in range(4)]
for i in range(n):
    if s[i] == "AC":
        c[0] += 1
    elif s[i] == "WA":
        c[1] += 1
    elif s[i] == "TLE":
        c[2] += 1
    elif s[i] == "RE":
        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())
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):
import sys
import bisect
from functools import lru_cache
from collections import defaultdict
inf = float('inf')
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**6)
def input(): return sys.stdin.readline().rstrip()
def read():
  return int(readline())
def reads():
  return map(int, readline().split())
n=read()

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

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

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

    for n in range(N):
        s = input()
        if s == "AC":
            ac += 1
        elif s == "WA":
            wa += 1
        elif s == "TLE":
            tle += 1
        else:
            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):
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):
judge = {"AC": 0, "WA": 0, "TLE": 0, "RE": 0}
for i in range(int(input())):
    judge[input()] += 1
print("AC x " + str(judge["AC"]))
print("WA x " + str(judge["WA"]))
print("TLE x " + str(judge["TLE"]))
print("RE x " + str(judge["RE"]))

Solution (Python):
N = int(input())
ans = [0,0,0,0]
for i in range(N):
    S = input()
    if S == "AC" :
        ans[0] += 1 
    elif S == "WA" :
        ans[1] += 1
    elif S == "TLE" :
        ans[2] += 1
    else :
        ans[3] += 1

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

Solution (Python):
N = int(input())
S_n=[]
for i in range(N):
    S_n.append(input())
a,w,t,r= 0,0,0,0
for i in range(N):
    if S_n[i] =="AC":
        a+=1
    elif S_n[i] =="WA":
        w+=1
    elif S_n[i] =="TLE":
        t+=1
    elif S_n[i] =="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):
import collections

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

num = collections.Counter(s)
print("AC x {}".format(num["AC"]))
print("WA x {}".format(num["WA"]))
print("TLE x {}".format(num["TLE"]))
print("RE x {}".format(num["RE"]))

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

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())
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 " + str(C0))
print("WA x "+str(C1))
print("TLE x "+str(C2))
print("RE x "+str(C3))

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

c = Counter(s)

for k in ['AC', 'WA', 'TLE', 'RE']:
    if k in c:
        print('{} x {}'.format(k, c[k]))
    else:
        print('{} x {}'.format(k, c[k]))

Solution (Python):
def solve():
    N = int(input())
    c = [0, 0, 0, 0]
    for _ in range(N):
        s = input()
        if s == 'AC':
            c[0] += 1
        elif s == 'WA':
            c[1] += 1
        elif s == 'TLE':
            c[2] += 1
        elif 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])



if __name__ == "__main__":
    solve()

Solution (Python):
from collections import Counter 
n = int(input())
s = [input() for i in range(n)]
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())

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

for _ in range(N):
    result = input()

    result_dict[result] = result_dict[result] + 1

for k, v in result_dict.items():
    print('{} x {}'.format(k, v))

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

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

ac, wa, tle, re = 0, 0, 0, 0
for i in range(N):
    judge = input()
    if judge == 'AC':
        ac += 1
    elif judge == 'WA':
        wa += 1
    elif judge == 'TLE':
        tle += 1
    elif judge == 'RE':
        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())
S = []
for _ 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 " + str(ac))
print("WA x " + str(wa))
print("TLE x " + str(tle))
print("RE x " + str(re))

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

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())
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,=map(int, input().split()) 
A=[0]*4
for i in range(N):
  S=input() 
  if "AC"==S:
    A[0]+=1
  if "WA"==S:
    A[1]+=1
  if "TLE"==S:
    A[2]+=1
  if "RE"==S:
    A[3]+=1
print("AC x "+str(A[0]))
print("WA x "+str(A[1]))
print("TLE x "+str(A[2]))
print("RE x "+str(A[3]))

Solution (Python):

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

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

Solution (Python):
n = int(input())
sList = []
for i in range(n):
    sList.append(input())
D = {'AC': 0, 'WA': 0, 'TLE': 0, 'RE': 0}
for j in sList:
    D[j] += 1
print('AC x', D['AC'])
print('WA x', D['WA'])
print('TLE x', D['TLE'])
print('RE x', D['RE'])

Solution (Python):
import sys
import os
import itertools
import numpy as np
from collections import deque

def main():
    if os.getenv("ENV")=='LOCAL':
        sys.stdin = open(os.path.dirname(__file__)+'/input.txt', 'r')

    N=int(input())
    ans=[0]*4

    for i in range(N):
        S = input()
        if S=='AC':
            ans[0]+=1
        elif S=='WA':
            ans[1]+=1
        elif S=='TLE':
            ans[2]+=1
        elif S=='RE':
            ans[3]+=1

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


if __name__ == '__main__':
    main()

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

ac=s.count("AC")
tle=s.count("TLE")
wa=s.count("WA")
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())

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 {}".format(c0))
print("WA x {}".format(c1))
print("TLE x {}".format(c2))
print("RE x {}".format(c3))

Solution (Python):
n=int(input())
ac=0
wa=0
tle=0
re=0
for _ 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 {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())

anss = [0]*4

for i in range(N):
    S = input()
    if S == 'AC':
        anss[0]+=1
    if S == 'WA':
        anss[1]+=1
    if S == 'TLE':
        anss[2]+=1
    if S == 'RE':
        anss[3]+=1

print('AC x {}'.format(anss[0]))
print('WA x {}'.format(anss[1]))
print('TLE x {}'.format(anss[2]))
print('RE x {}'.format(anss[3]))

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

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

Solution (Python):
import sys
import time
import math
st = time.perf_counter()
def inpl():
    return list(map(int, input().split()))


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


ed = time.perf_counter()
print('time:', ed-st, file=sys.stderr)

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

print('AC x ' + str(list['AC']))
print('WA x ' + str(list['WA']))
print('TLE x ' + str(list['TLE']))
print('RE x ' + str(list['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",ac)
print("WA x", wa)
print("TLE x", tle)
print("RE x", re)

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

ans = defaultdict(int)
for i in range(n):
    ans[input()] += 1

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

Solution (Python):
N=int(input())
L=list()
for i in range(N):
  L.append(input())
a=L.count('AC')
b=L.count('WA')
c=L.count('TLE')
d=L.count('RE')
print('AC x',a)
print('WA x',b)
print('TLE x',c)
print('RE x',d)

Solution (Python):
def main():
    ac, wa, tle, re = 0, 0, 0, 0
    n = int(input())
    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", ac)
    print("WA", "x", wa)
    print("TLE", "x", tle)
    print("RE", "x", re)


if __name__ == "__main__":
    main()

Solution (Python):
import sys

import math
import itertools
import random
n = int(input())
li = [0] * 4  
for i in range(n):
    tmp = input()
    if (tmp == "AC"):
        li[0] += 1
    elif (tmp == "WA"):
        li[1] += 1
    elif (tmp == "TLE"):
        li[2] += 1
    else:
        li[3] += 1
print("AC x " + str(li[0]))
print("WA x " + str(li[1]))
print("TLE x " + str(li[2]))
print("RE x "+str(li[3]))

Solution (Python):
n=int(input())
a=[input() for i in range(n)]
ans=[0]*4
for i in range(n):
  if a[i]=="AC":
    ans[0]+=1
  elif a[i]=="WA":
    ans[1]+=1
  elif a[i]=="TLE":
    ans[2]+=1
  else:
    ans[3]+=1
print("AC x " +str(ans[0]))
print("WA x "+str(ans[1]))
print("TLE x "+str(ans[2]))
print("RE x "+str(ans[3]))

Solution (Python):
N = int(input())
S = [input() for _ in range(N)]
ls = ["AC","WA","TLE","RE"]
for i in range(4):
  print("{} x {}".format(ls[i],S.count(ls[i])))

Solution (Python):
N=int(input())
S=list()
ac=0
wa=0
tle=0
re=0
for i in range(N):
  S.append(input())
for c in S:
  if c == "AC":
    ac+=1
  elif c=="WA":
    wa+=1
  elif c=="TLE":
    tle+=1
  elif c=="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 _ in range(N)]

count = {'AC': 0, 'WA': 0, 'TLE': 0, 'RE': 0}
for res in S:
    count[res] += 1
        
for res in ['AC', 'WA', 'TLE', 'RE']:
    print('{} x {}'.format(res, count[res]))

Solution (Python):
_,*s=map(str,open(0).read().split())
c=['AC','WA','TLE','RE']
for i in range(4):
    print(c[i]+" x "+str(s.count(c[i])))

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

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

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

rem={"AC":0,"WA":0,"TLE":0,"RE":0}
for i in range(N):
    mess=input()
    rem[mess]+=1

for i in rem.keys():
    print(i," x ",rem[i])

Solution (Python):
import sys
sys.setrecursionlimit(10 ** 7)



from collections import deque



def input():
    return sys.stdin.readline().rstrip()


def main():
    N = int(input())
    l = []
    for i in range(N):
        s = input()
        l.append(s)

    print("AC x {}".format(l.count("AC")))
    print("WA x {}".format(l.count("WA")))


    print("TLE x {}".format(l.count("TLE")))
    print("RE x {}".format(l.count("RE")))

if __name__ == "__main__":
    main()

Solution (Python):
dic = {'AC':0, 'WA':0, 'TLE':0, 'RE':0}
n = int(input())
for i in range(n):
  dic[input()] += 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())

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

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

for s in res:
    print(s + " x " + str(res[s]))

Solution (Python):
def main():
    n = int(input())
    s = []
    a,w,t,r = 0,0,0,0
    for i in range(n):
        tmp = input()
        if tmp=='AC':
           a+=1
        elif tmp=='WA':
            w+=1
        elif tmp=='TLE':
            t += 1
        else:
            r+=1
    print('AC x',a)
    print('WA x',w)
    print('TLE x',t)
    print('RE x',r)
main()

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
    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())
d={"AC":0,"WA":0,"TLE":0,"RE":0}
for i in range(n):
  s=input()
  d[s]+=1
  
for k,v in d.items():
  print(k,"x",v)
  
print()

Solution (Python):
N = int(input())
ans = [0,0,0,0]
for _ in range(N):
    a = input()
    if a == 'AC':
        ans[0] += 1
    elif a == 'WA':
        ans[1] += 1
    elif a == 'TLE':
        ans[2] += 1
    elif a == 'RE':
        ans[3] += 1
print('AC x',ans[0])
print('WA x',ans[1])
print('TLE x',ans[2])
print('RE x',ans[3])

Solution (Python):
N = int(input())
n_ac = 0
n_wa = 0
n_tle = 0
n_re = 0
for i in range(N):
    s = input()
    if s == 'AC':
        n_ac += 1
    elif s == 'WA':
        n_wa += 1
    elif s == 'TLE':
        n_tle += 1
    elif s == 'RE':
        n_re += 1
print('AC x {}'.format(n_ac))
print('WA x {}'.format(n_wa))
print('TLE x {}'.format(n_tle))
print('RE x {}'.format(n_re))

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

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

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

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

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

Solution (Python):
a=[0]*5
for _ in range(int(input())):
    s=input()
    if s=="AC":
        a[0]+=1
    elif s=="TLE":
        a[1]+=1
    elif s=="WA":
        a[2]+=1
    else:
        a[3]+=1
        
print("AC x"+ " " +str(a[0]))
print("WA x" + " " + str(a[2]))
print("TLE x" + " " + str(a[1]))
print("RE x" + " " + str(a[3]))

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

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

for d in data:
  if d == "AC":
    ac += 1
  elif d == "WA":
    wa += 1
  elif d == "TLE":
    tle += 1
  elif d == "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 = []
AC = 0
WA = 0
TLE = 0
RE = 0
for i in range(N):
    s = input()
    if s == "AC":
        AC = AC + 1
    elif s == "WA":
        WA = WA + 1
    elif s == "TLE":
        TLE = TLE + 1
    else :
        RE = RE + 1

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

Solution (Python):
n=int(input())
c=[0]*4
for i in range(n):
    s=str(input())
    if s=="AC":
        c[0]+=1
    elif s=="WA":
        c[1]+=1
    elif s=="TLE":
        c[2]+=1
    elif s=="RE":
        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 _ in range(n)]
c={}
c["AC"] = 0
c["WA"] = 0
c["TLE"] = 0
c["RE"] = 0
for s in S:
    c[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())
S=[]
C=[0]*4

for i in range(N):
    s=input()
    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):
n = int(input())
s = [input() for _ in range(n)]

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

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

Solution (Python):

n = int(input())
res = {"AC": 0, "WA": 0, "TLE": 0, "RE": 0}

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

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

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

    for _ in range(N):
        S = input()
        count[S] += 1
    ans = f"""AC x {count["AC"]}
WA x {count["WA"]}
TLE x {count["TLE"]}
RE x {count["RE"]}"""
    print(ans)


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())
s=[]
for i in range(n):
    s_=input()
    s.append(s_)


import collections
c = collections.Counter(s)
print("AC x "+str(c["AC"]))
print("WA x "+str(c["WA"]))
print("TLE x "+str(c["TLE"]))
print("RE x "+str(c["RE"]))

Solution (Python):
N = 6
ARR = [
    "AC",
    "TLE",
    "AC",
    "AC",
    "WA",
    "TLE"
]
N = int(input())
ARR = []

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

acNum = 0
tleNum = 0
waNum = 0
reNum = 0
for i in range(N):
    if ARR[i] == "AC":
        acNum +=1

    if ARR[i] == "TLE":
        tleNum += 1

    if ARR[i] == "WA":
        waNum += 1

    if ARR[i] == "RE":
        reNum += 1



print("AC x {}".format(acNum))
print("WA x {}".format(waNum))
print("TLE x {}".format(tleNum))
print("RE x {}".format(reNum))

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

ac, wa, tle, re = 0, 0, 0, 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", ac)
print("WA x", wa)
print("TLE x", tle)
print("RE x", re)

Solution (Python):
AC = 0
WA = 0
LTE = 0
RE = 0

N = int(input())
for k in range(N):
  i = input()
  if i == "AC":
    AC += 1
  elif i == "WA":
    WA += 1
  elif i == "TLE":
    LTE += 1
  elif i == "RE":
    RE += 1

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

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

li = [0]*4

for i in range(n):
    if s[i] == 'AC':
        li[0] += 1
    elif s[i] == 'WA':
        li[1] += 1
    elif s[i] == 'TLE':
        li[2] += 1
    elif s[i] == 'RE':
        li[3] += 1
        
print('AC x '+str(li[0]))
print('WA x '+str(li[1]))
print('TLE x '+str(li[2]))
print('RE x '+str(li[3]))

Solution (Python):
N = int(input())
S = [str(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):




import sys
input = sys.stdin.readline



def main():
    N = int(input())
    S = [input().rstrip() for i in range(N)]

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

    for i in range(N):
        C[S[i]] += 1

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



main()

Solution (Python):

from collections import Counter

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

N = int(input())
for _ in range(N):
    S = input()
    d[S] += 1

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

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

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

for i in range(N):
  x=input()
  if x=="AC":
    ac+=1
  if x=="WA":
    wa+=1
  if x=="TLE":
    tle+=1
  if x=="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)]
ans = [0] * 4
for i in range(N):
  if S[i] == "AC":
    ans[0] += 1
  elif S[i] == "WA":
    ans[1] += 1
  elif S[i] == "TLE":
    ans[2] += 1
  elif S[i] == "RE":
    ans[3] += 1    
print("AC x " + str(ans[0]))    
print("WA x " + str(ans[1])) 
print("TLE x " + str(ans[2]))  
print("RE x " + str(ans[3]))

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

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