ZhenlongDai/ACPR huggingface dataset:
Problem: p03288
Buggy submission (Python (3.4.3), verdict: Wrong Answer):


def main():
    r = int(input())
    if r < 2000:
        print('ABC')
    elif r >= 1200 and r < 2800:
        print('ARC')
    else:
        print('AGC')

if __name__ == '__main__':
    main()

Failing test case input:
1200

Expected output:
ARC

Actual output:
ABC


Fixed submission (verdict: Accepted):


def main():
    r = int(input())
    if r < 1200:
        print('ABC')
    elif r >= 1200 and r < 2800:
        print('ARC')
    else:
        print('AGC')

if __name__ == '__main__':
    main()

Problem: p03288
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
r = int(input())
if r <= 1200:
  print("ABC")
elif r <= 2800:
  print("ARC")
else:
  print("AGC")


Failing test case input:
1200

Expected output:
ARC

Actual output:
ABC


Fixed submission (verdict: Accepted):
r = int(input())
if r < 1200:
  print("ABC")
elif r < 2800:
  print("ARC")
else:
  print("AGC")

Problem: p03288
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a = int(input())
if a < 1200:
    print("ABC")
elif 1200 <= a < 2800:
    print("ARC")
else:
    ("AGC")

    

Failing test case input:
4208

Expected output:
AGC

Actual output:

Fixed submission (verdict: Accepted):
a = int(input())
if a < 1200:
    print("ABC")
elif 1200 <= a < 2800:
    print("ARC")
elif a >= 2800:
    print("AGC")

Problem: p03288
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
R = int(input())
if R > 1200:
    print("ABC")
elif 1200 <= R < 2800:
    print("ARC")
else:
    print("AGC")

Failing test case input:
-129

Expected output:
ABC


Actual output:
AGC


Fixed submission (verdict: Accepted):
R = int(input())
if R < 1200:
    print("ABC")
elif 1200 <= R < 2800:
    print("ARC")
else:
    print("AGC")

Problem: p03288
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
r = int (input ())
if r > 2800:
  print ('AGC')
elif r > 1200:
  print ('ARC')
else:
  print ('ABC')

Failing test case input:
1200

Expected output:
ARC

Actual output:
ABC


Fixed submission (verdict: Accepted):
r = int (input ())
if r >= 2800:
  print ('AGC')
elif r >= 1200:
  print ('ARC')
else:
  print ('ABC')

Problem: p03288
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
R=int(input())

if R<=1200:
    print('ABC')
elif R>1200 and R<=2800:
    print('ARC')
else :
    print('AGC')

Failing test case input:
1200

Expected output:
ARC

Actual output:
ABC


Fixed submission (verdict: Accepted):
R=int(input())

if R<1200:
    print('ABC')
elif R>=1200 and R<2800:
    print('ARC')
else :
    print('AGC')

Problem: p03288
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
r = int(input())
print("ABC" if r < 1200 else "AGC" if r < 2800 else"AGC")

Failing test case input:
1200

Expected output:
ARC

Actual output:
AGC


Fixed submission (verdict: Accepted):
r = int(input())
print("ABC" if r < 1200 else "ARC" if r < 2800 else "AGC")
Problem: p03288
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
r = int(input())

if r < 1200:
  print('ABC')
elif r >= 1200 and r < 2800:
  print('AGC')
else:
  print('ARC')

Failing test case input:
4178

Expected output:
AGC


Actual output:
ARC


Fixed submission (verdict: Accepted):
r = int(input())

if r < 1200:
  print('ABC')
elif r >= 1200 and r < 2800:
  print('ARC')
else:
  print('AGC')

Problem: p03288
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
R = int(input("数値を入力："))
if R < 1200:
    print("ABC")

elif R >= 1200 and R < 2800:
    print("ARC")
    
else:
    print("AGC")

Failing test case input:
4208

Expected output:
AGC

Actual output:
数値を入力：AGC


Fixed submission (verdict: Accepted):
R = int(input(""))
if R < 1200:
    print("ABC")

elif R >= 1200 and R < 2800:
    print("ARC")
    
elif R >= 2800:
    print("AGC")

Problem: p03288
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
r = int(input())

if r < 1200:
  print('ABC')
elif r >= 1200 and r < 2800:
  print('AGC')


Failing test case input:
4208

Expected output:
AGC

Actual output:

Fixed submission (verdict: Accepted):
r = int(input())

if r < 1200:
  print('ABC')
elif r >= 1200 and r < 2800:
  print('ARC')
else:
  print('AGC')

Problem: p03288
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
b= int(input().rstrip())
if b<1200:
	a="ABC"
elif b<2800 & b >1199:
	a="ARC"
else:
	a="AGC"
print(a)


Failing test case input:
1200

Expected output:
ARC

Actual output:
AGC


Fixed submission (verdict: Accepted):
b= int(input().rstrip())
if b<1200:
	a="ABC"
elif b<2800 and b >=1200:
	a="ARC"
else:
	a="AGC"
print(a)

Problem: p03288
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())
if n < 1200:
  print('ABC')
elif n < 2800:
  print('ARC')
else:
  print('ARC')

Failing test case input:
4178

Expected output:
AGC


Actual output:
ARC


Fixed submission (verdict: Accepted):
n = int(input())
if n < 1200:
  print('ABC')
elif n < 2800:
  print('ARC')
else:
  print('AGC')

Problem: p03288
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
R =int(input())
print("ARC" if R <1200 else "AGC")

Failing test case input:
1199

Expected output:
ABC

Actual output:
ARC


Fixed submission (verdict: Accepted):
R =int(input())
print("ABC" if R <1200 else "ARC" if R < 2800 else "AGC")

Problem: p03288
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
r=int(input())
if r < 1200:
    print("ABC")
elif 1999 < r < 2800:
    print("ARC")
else:
    print("AGC")

Failing test case input:
1200

Expected output:
ARC

Actual output:
AGC


Fixed submission (verdict: Accepted):
r=int(input())
if r < 1200:
    print("ABC")
elif 1199 < r < 2800:
    print("ARC")
else:
    print("AGC")

Problem: p03288
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
r = int(input())
if r >= 2800:
  print('AGC')
if r >= 1200:
  print('ARC')
if r < 1200:
  print('ABC')

Failing test case input:
4208

Expected output:
AGC

Actual output:
AGC
ARC


Fixed submission (verdict: Accepted):
r = int(input())
if r >= 2800:
  print('AGC')
  exit()
if r >= 1200:
  print('ARC')
  exit()
if r < 1200:
  print('ABC')
Problem: p03288
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
r = int(input())

if r < 1200:
    print("ABC")
elif r < 2800:
    print("ARC")
elif r > 4208:
    print("AGC")

Failing test case input:
4208

Expected output:
AGC

Actual output:

Fixed submission (verdict: Accepted):
r = int(input())

if r < 1200:
    print("ABC")
elif r < 2800:
    print("ARC")
else:
    print("AGC")

Problem: p03288
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
r = int(input())
if r < 1200:
  print("ABC")
else:
  print("ARC")

Failing test case input:
4178

Expected output:
AGC


Actual output:
ARC


Fixed submission (verdict: Accepted):
r = int(input())
if r< 1200:
  print("ABC")
elif(r<2800):
  print("ARC")
else:
  print("AGC")

Problem: p03288
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
r = int(input())
if r < 1200:
    print('ABC')
if r < 2800:
    print('ARC')
else:
    print('AGC')


Failing test case input:
1199

Expected output:
ABC

Actual output:
ABC
ARC


Fixed submission (verdict: Accepted):
r = int(input())
if r < 1200:
    print('ABC')
elif r < 2800:
    print('ARC')
else:
    print('AGC')

Problem: p03288
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
r=int(input())
if r<1200:
    print("ABC")
elif 1200<r<2800:
    print("ARC")
else:
    print("AGC")

Failing test case input:
1200

Expected output:
ARC

Actual output:
AGC


Fixed submission (verdict: Accepted):
r=int(input())
if r<1200:
    print("ABC")
elif 1200<=r<2800:
    print("ARC")
else:
    print("AGC")

Problem: p03288
Buggy submission (Python (2.7.6), verdict: Wrong Answer):
x = int(input())
if x<=1200:
	print('ABC')
elif x<=2800:
	print('ARC')
else:
	print('AGC')

Failing test case input:
1200

Expected output:
ARC

Actual output:
ABC


Fixed submission (verdict: Accepted):
x = int(input())
if x<1200:
	print('ABC')
elif x<2800:
	print('ARC')
else:
	print('AGC')

Problem: p03288
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
R=int(input())
if R<1200:
      print('ABC')
if R>1200 and R<2800 :
      print('ARC')
if R>4208 :
      print('AGC')

Failing test case input:
4178

Expected output:
AGC


Actual output:

Fixed submission (verdict: Accepted):
R=int(input())
if R<1200:
      print('ABC')
if R>=1200 and R<2800 :
      print('ARC')
if R>=2800 and R<=4208 :
      print('AGC')

Problem: p03288
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N3 = int(input())
if N3 < 1200:
    print('ABC')
elif N3 > 1999 and N3 < 2800:
    print('ARC')
else:
    print('AGC')

Failing test case input:
1200

Expected output:
ARC

Actual output:
AGC


Fixed submission (verdict: Accepted):
N3 = int(input())
if N3 < 1200:
    print('ABC')
elif 1200 <= N3 < 2800:
    print('ARC')
else:
    print('AGC')

Problem: p03288
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
R=int(input())
if R<=1200:
    output="ABC"
elif R<=2800:
    output="ARC"
else:
    output="AGC"
print(output)

Failing test case input:
1200

Expected output:
ARC

Actual output:
ABC


Fixed submission (verdict: Accepted):
R=int(input())
if R<1200:
    output="ABC"
elif R<2800:
    output="ARC"
else:
    output="AGC"
print(output)
Problem: p03288
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
r = int(input())

if r<1200:
  print('ABC')
if 1200<=r<2800:
  print('ARC')
else:
  print('AGC')

Failing test case input:
-129

Expected output:
ABC


Actual output:
ABC
AGC


Fixed submission (verdict: Accepted):
r = int(input())
if r < 1200:
    print("ABC")
elif 1200 <= r < 2800:
    print("ARC")
else:
    print("AGC")

Problem: p03288
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
a = int(input())
if a <1200:
  print("ABC")
elif a <2800:
  print("ARC")
else:
  print("ARC")

Failing test case input:
4178

Expected output:
AGC


Actual output:
ARC


Fixed submission (verdict: Accepted):
a = int(input())
if a <1200:
  print("ABC")
elif a <2800:
  print("ARC")
else:
  print("AGC")

Problem: p03288
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
r = int(input())
if r < 1200:
  print("ABC")
elif r < 2800:
  print("ARC")
else:
  print("ABC")

Failing test case input:
4208

Expected output:
AGC

Actual output:
ABC


Fixed submission (verdict: Accepted):
r = int(input())
if r < 1200:
  print("ABC")
elif r < 2800:
  print("ARC")
else:
  print("AGC")

Problem: p03288
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
R = int(input())

if R<1200:
    print("ABC")
if R<2800 and R>1200:
    print("ARC")
if R>2800:
    print("AGC")

Failing test case input:
1200

Expected output:
ARC

Actual output:

Fixed submission (verdict: Accepted):
R = int(input())

if R<1200:
    print("ABC")
elif R<2800:
    print("ARC")
else :
    print("AGC")

Problem: p03288
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
r=int(input())
if r<=1200:
  print('ABC')
elif r<=2800:
  print("ARC")
else:
  print("AGC")

Failing test case input:
1200

Expected output:
ARC

Actual output:
ABC


Fixed submission (verdict: Accepted):
r=int(input())
if r<1200:
  print('ABC')
elif r<2800:
  print("ARC")
else:
  print("AGC")

Problem: p03288
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
R = int(input())

if R < 1200:
    print('ABC')
elif 2800:
    print('ARC')
else:
    print('AGC')


Failing test case input:
4208

Expected output:
AGC

Actual output:
ARC


Fixed submission (verdict: Accepted):
R = int(input())

if R < 1200:
    print('ABC')
elif R < 2800:
    print('ARC')
else:
    print('AGC')

Problem: p03288
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
R = int(input())
if R<1200:
    r='ABC'
if R<2800:
    r='ARC'
else:
    r='AGC'
print(r)

Failing test case input:
1199

Expected output:
ABC

Actual output:
ARC


Fixed submission (verdict: Accepted):
R = int(input())
r = 'AGC'
if R<2800: r='ARC'
if R<1200: r='ABC'
print(r)

Problem: p03288
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
r = int(input())

if r < 1200:
    print("ABC")
elif r > 1200 or r <= 2800:
    print("ARC")
else:
    print("AGC")

Failing test case input:
4208

Expected output:
AGC

Actual output:
ARC


Fixed submission (verdict: Accepted):
r = int(input())

if r < 1200:
    print("ABC")
elif r < 2800:
    print("ARC")
else:
    print("AGC")
Problem: p03288
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a=int(input())
if a>=1199:
  print('ABC')
elif a>=2799:
  print('ARC')
else:
  print('AGC')


Failing test case input:
-129

Expected output:
ABC


Actual output:
AGC


Fixed submission (verdict: Accepted):
a=int(input())
if a<=1199:
  print('ABC')
elif a<=2799:
  print('ARC')
else:
  print('AGC')

Problem: p03288
Buggy submission (Python (3.4.3), verdict: Wrong Answer):

R = int(input())
print(R)
if R < 1200:
    print('ABC')
elif R < 2800:
    print('ARC')
else:
    print('AGC')

Failing test case input:
-129

Expected output:
ABC


Actual output:
-129
ABC


Fixed submission (verdict: Accepted):

R = int(input())

if R < 1200:
    print('ABC')
elif R < 2800:
    print('ARC')
else:
    print('AGC')

Problem: p03288
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())

if N < 1200:
    print("ABC")
if N >= 1200 and N < 2800:
    print("ARC")
else:
    print("AGC")

Failing test case input:
-129

Expected output:
ABC


Actual output:
ABC
AGC


Fixed submission (verdict: Accepted):
N = int(input())

if N < 1200:
    print("ABC")
if N >= 1200 and N < 2800:
    print("ARC")
if N >= 2800:
    print("AGC")

Problem: p03288
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
r = int(input())
if r >= 2800:
    print('AGC')
else:
    if r <= 1200:
        print('ABC')
    else:
        print('ARC')

Failing test case input:
1200

Expected output:
ARC

Actual output:
ABC


Fixed submission (verdict: Accepted):
r = int(input())
if r >= 2800:
    print('AGC')
else:
    if r < 1200:
        print('ABC')
    else:
        print('ARC')

Problem: p03288
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())
if n < 1199:
  print("ABC")
elif 1200 <= n < 2800:
  print("ARC")
else:
  print("AGC")


Failing test case input:
1199

Expected output:
ABC

Actual output:
AGC


Fixed submission (verdict: Accepted):
n = int(input())
if n < 1200:
  print("ABC")
elif 1200 <= n < 2800:
  print("ARC")
else:
  print("AGC")
Problem: p02282
Buggy submission (Python3, verdict: Wrong Answer):
INF = 10**3


def reconstruction(o_ary, p_ary, i_ary, l, r):
    if l >= r:
        return

    c = INF
    for i in i_ary[l:r]:
        ind = p_ary.index(i)
        if ind < c:
            c = i
    m = i_ary.index(c)

    reconstruction(o_ary, p_ary, i_ary, l, m)
    reconstruction(o_ary, p_ary, i_ary, m + 1, r)

    o_ary.append(c)


n = int(input())
p_ary = [int(_) for _ in input().split()]
i_ary = [int(_) for _ in input().split()]
o_ary = []
reconstruction(o_ary, p_ary, i_ary, 0, n)
print(*o_ary)


Failing test case input:
4
2 1 3 4
2 1 4 3

Expected output:
4 3 1 2


Actual output:
2 4 3 1


Fixed submission (verdict: Accepted):
INF = 10**3


def reconstruction(o_ary, p_ary, i_ary, l, r):
    if l >= r:
        return

    ind = INF
    for i in i_ary[l:r]:
        tmp_ind = p_ary.index(i)
        if ind > tmp_ind:
            ind = tmp_ind
    c = p_ary[ind]
    m = i_ary.index(c)

    reconstruction(o_ary, p_ary, i_ary, l, m)
    reconstruction(o_ary, p_ary, i_ary, m + 1, r)
    o_ary.append(c)


n = int(input())
p_ary = [int(_) for _ in input().split()]
i_ary = [int(_) for _ in input().split()]
o_ary = []
reconstruction(o_ary, p_ary, i_ary, 0, n)
print(*o_ary)

Problem: p02282
Buggy submission (Python3, verdict: Wrong Answer):
def reconstruct(pre, in_):
    if not pre:
        return -1
    root = pre[0]
    i = in_.index(root)
    tree[root] = (reconstruct(pre[1 : i+1], in_[:i]), reconstruct(pre[i+1:], in_[i+1:]))
    return root

def postorder(i):
    if i == -1:
        return
    l, r = tree[i]
    for v in postorder(l):
        yield v
    for v in postorder(r):
        yield v
    yield i

n = int(input())
tree = [None for i in range(n+1)]
pre_tree = list(map(int, input().split()))
in_tree = list(map(int, input().split()))
reconstruct(pre_tree, in_tree)
print(tree)
print(*postorder(pre_tree[0]))


Failing test case input:
4
1 4 3 2
1 2 3 4

Expected output:
2 3 4 1


Actual output:
[None, (-1, 4), (-1, -1), (2, -1), (3, -1)]
2 3 4 1


Fixed submission (verdict: Accepted):
def reconstruct(pre, in_):
    if not pre:
        return -1
    root = pre[0]
    i = in_.index(root)
    tree[root] = (reconstruct(pre[1 : i+1], in_[:i]), reconstruct(pre[i+1:], in_[i+1:]))
    return root

def postorder(i):
    if i == -1:
        return
    l, r = tree[i]
    for v in postorder(l):
        yield v
    for v in postorder(r):
        yield v
    yield i

n = int(input())
tree = [None for i in range(n+1)]
pre_tree = list(map(int, input().split()))
in_tree = list(map(int, input().split()))
reconstruct(pre_tree, in_tree)
print(*postorder(pre_tree[0]))
Problem: p02282
Buggy submission (Python3, verdict: Wrong Answer):
n = int(input())
pre = list(map(int, input().split()))
ino = list(map(int, input().split()))


root = pre[1]
pre = iter(pre).__next__

def dfs(l, r):
    if l >= r:
        return
    c = pre()
    m = ino.index(c)
    dfs(l, m)
    dfs(m+1, r)
    print(c)
    
dfs(0, len(ino))




Failing test case input:
4
1 4 3 2
1 2 3 4

Expected output:
2 3 4 1


Actual output:
2
3
4
1


Fixed submission (verdict: Accepted):
n = int(input())
pre = list(map(int, input().split()))
ino = list(map(int, input().split()))

d = []
root = pre[0]
pre = iter(pre).__next__

def dfs(l, r):
    global d
    if l >= r:
        return
    c = pre()
    m = ino.index(c)
    dfs(l, m)
    dfs(m+1, r)
    d += [c]
    
dfs(0, len(ino))
print(*d)

Problem: p02282
Buggy submission (Python3, verdict: Wrong Answer):
def getPostorder(preorder, inorder):
    if not preorder:
        return []
    postorder = []
    root = preorder[0]
    rootIndex = inorder.index(root)

    postorder.extend(getPostorder(preorder[1:rootIndex + 1], inorder[:rootIndex]))
    postorder.extend(getPostorder(preorder[rootIndex + 1:], inorder[rootIndex + 1:]))
    postorder.append(root)

    return postorder 

if __name__ == '__main__':
    n = int(input())
    preorder = list(map(int, input().split()))
    inorder = list(map(int, input().split()))
    print(getPostorder(preorder, inorder))

Failing test case input:
4
1 2 3 4
2 1 3 4

Expected output:
2 4 3 1


Actual output:
[2, 4, 3, 1]


Fixed submission (verdict: Accepted):
def getPostorder(preorder, inorder):
    if not preorder:
        return []
    postorder = []
    root = preorder[0]
    rootIndex = inorder.index(root)

    postorder.extend(getPostorder(preorder[1:rootIndex + 1], inorder[:rootIndex]))
    postorder.extend(getPostorder(preorder[rootIndex + 1:], inorder[rootIndex + 1:]))
    postorder.append(root)

    return postorder 

if __name__ == '__main__':
    n = int(input())
    preorder = list(map(int, input().split()))
    inorder = list(map(int, input().split()))
    print(*getPostorder(preorder, inorder))
Problem: p03889
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
s = list(input())
t = s[::-1]
for i in t:
  if i == "p":
    i = "q"
  elif i == "q":
    i = "p"
  if i == "b":
    i = "d"
  elif i == "d":
    i = "b" 
if s == t:
  ans = "Yes"
else:
  ans = "No"
print(ans)
    

Failing test case input:
bpqd

Expected output:
Yes


Actual output:
No


Fixed submission (verdict: Accepted):
s = list(input())
t = s[::-1]
for i in range(len(t)):
  if t[i] == "p":
    t[i] = "q"
  elif t[i] == "q":
    t[i] = "p"
  if t[i] == "b":
    t[i] = "d"
  elif t[i] == "d":
    t[i] = "b" 
if s == t:
  ans = "Yes"
else:
  ans = "No"
print(ans)

Problem: p03889
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
s = list(input())
t = s[::-1]
for i in t:
  if i == "p":
    i = "q"
  if i == "q":
    i = "p"
  if i == "b":
    i = "d"
  if i == "d":
    i = "b" 
if s == t:
  ans = "Yes"
else:
  ans = "No"
print(ans)
    

Failing test case input:
qbdp

Expected output:
Yes


Actual output:
No


Fixed submission (verdict: Accepted):
s = list(input())
t = s[::-1]
for i in range(len(t)):
  if t[i] == "p":
    t[i] = "q"
  elif t[i] == "q":
    t[i] = "p"
  if t[i] == "b":
    t[i] = "d"
  elif t[i] == "d":
    t[i] = "b" 
if s == t:
  ans = "Yes"
else:
  ans = "No"
print(ans)

Problem: p03889
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
s = list(input())
t = list(s[::-1])
for i in range(len(s)):
    if t[i] == 'b':
        t[i] = 'd'
    if t[i] == 'd':
        t[i] = 'b'
    if t[i] == 'p':
        t[i] = 'q'
    else:
        t[i] = 'p'
if s == t:
    print('Yes')
else:
    print('No')

Failing test case input:
dqpb

Expected output:
Yes


Actual output:
No


Fixed submission (verdict: Accepted):
s = list(input())
t = list(s[::-1])
for i in range(len(s)):
    if t[i] == 'b':
        t[i] = 'd'
    elif t[i] == 'd':
        t[i] = 'b'
    elif t[i] == 'p':
        t[i] = 'q'
    else:
        t[i] = 'p'
if s == t:
    print('Yes')
else:
    print('No')
Problem: p02701
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
n = int(input())
li = []
count = 0
for i in range(n):
    li.append(input())
li.sort()
print(li)
for i in range(n-1):
    if li[i] == li[i+1]:
        count += 1
print(n-count)

Failing test case input:
4
`caa
a
baa
aa

Expected output:
4


Actual output:
['`caa', 'a', 'aa', 'baa']
4


Fixed submission (verdict: Accepted):
n = int(input())
li = []
count = 0
for i in range(n):
    li.append(input())
li.sort()
for i in range(n-1):
    if li[i] == li[i+1]:
        count += 1
print(n-count)

Problem: p02701
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
N = int(input())
a = []

for i in range(N):
  a.append(input())
  
b = set(a)
print(len(a))

Failing test case input:
5
grape
grape
graoe
grape
epaqg

Expected output:
3


Actual output:
5


Fixed submission (verdict: Accepted):
N = int(input())
a = []

for i in range(N):
  a.append(input())
  
b = set(a)
print(len(b))

Problem: p02701
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
i = int(input())
lists = []
for j in range(i):
    lists.insert(j, str(input()))

print(lists)
print(len(set(lists)))


Failing test case input:
3
flppa
fgnaro
appld

Expected output:
3


Actual output:
['flppa', 'fgnaro', 'appld']
3


Fixed submission (verdict: Accepted):
N = int(input())
lists = []
for i in range(N):
    lists.append(input())
set_S = list(set(lists))
print(len(set_S))

Problem: p02701
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
a=int(input())
*b,=map(str, open(0).read().split())
s=set(b)
print(min(a,len(s)))

Failing test case input:
4
`bca
b
a`b
bb

Expected output:
4


Actual output:
0


Fixed submission (verdict: Accepted):
a,*b=map(str, open(0).read().split())
s=set(b)
print(min(int(a),len(s)))

Problem: p02701
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
N = int(input())
Word_list = []
ans = 0
for i in range(N):
    Gift = input()
    CHECK = "Nothing"
    for i in Word_list:
        if i == Gift:
            CHECK = "Exist"
        break
    if CHECK == "Nothing":
        Word_list.append(Gift)
        ans += 1
print(ans)


Failing test case input:
5
geapr
grape
graoe
grape
epaqg

Expected output:
4


Actual output:
5


Fixed submission (verdict: Accepted):
N = int(input())
Word_list = []
ans = 0

for i in range(N):
    Gift = input()
    Word_list.append(Gift)
Word_list.sort()

Before_Word = ""

for i in range(N):
    if Word_list[i] != Before_Word:
        ans += 1
        Before_Word = Word_list[i]

print(ans)

Problem: p02701
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
import collections
n = int(input())
List = [input() for i in range(n-1)]
c = collections.Counter(List)
print(len(c))


Failing test case input:
3
bpple
egnaro
apple

Expected output:
3


Actual output:
2


Fixed submission (verdict: Accepted):
import collections
n = int(input())
List = [input() for i in range(n)]
c = collections.Counter(List)
print(len(c))
Problem: p02701
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
n = int(input())
s = set()
for i in s:
  s.add(input())
print(len(s))

Failing test case input:
4
`caa
b
b`a
bb

Expected output:
4


Actual output:
0


Fixed submission (verdict: Accepted):
n = int(input())
s = set()
for i in range(n):
    s.add(input())
print(len(s))

Problem: p02701
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
n = int(input())
lis = []
for i in range(n):
  i = str(input())
  ilen = len(i)
  lis.append(ilen)
  
kind = int(len(lis))
print(kind)


Failing test case input:
5
grape
grape
graoe
grape
grape

Expected output:
2


Actual output:
5


Fixed submission (verdict: Accepted):
n = int(input())
lis = set()
for i in range(n):
  i = str(input())
  lis.add(i)
  
kind = int(len(lis))
print(kind)

Problem: p02701
Buggy submission (PyPy3 (7.3.0), verdict: Wrong Answer):
n=int(input())
s={input() for i in range(n)}

print(s)
print(len(s))

Failing test case input:
5
grape
grape
graoe
grape
eparg

Expected output:
3


Actual output:
{'graoe', 'eparg', 'grape'}
3


Fixed submission (verdict: Accepted):
n=int(input())
s={input() for i in range(n)}

print(len(s))

Problem: p02701
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
def main():

    N = int(input())

    S = []
    for i in range(N):
        S.append(input())
    
    now_name = S[0]
    ans = 1
    for i in range(N):
        if now_name != S[i]:
            ans += 1
    
    print('{}'.format(ans))



if __name__ == '__main__':
    main()

Failing test case input:
5
geapr
grape
graoe
grape
epaqg

Expected output:
4


Actual output:
5


Fixed submission (verdict: Accepted):
def main():

    N = int(input())

    S = []
    for i in range(N):
        S.append(input())
    
    S.sort()

    now_name = S[0]
    ans = 1
    for i in range(N):
        if now_name != S[i]:
            ans += 1
            now_name = S[i]
    
    print('{}'.format(ans))



if __name__ == '__main__':
    main()

Problem: p02701
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
import collections
N=int(input())
L=[input() for i in range(N)] 
C = collections.Counter(L)
D = list(C.values())
E=sum(D)
print(E)

Failing test case input:
5
grape
grape
graoe
grape
epaqg

Expected output:
3


Actual output:
5


Fixed submission (verdict: Accepted):
import collections
N=int(input())
L=[input() for i in range(N)] 
C = collections.Counter(L)
D = list(C.values())
print(len(D))

Problem: p02701
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
N=int(input())
dic={}
for i in range(N):
  tmp=input()
  if tmp not in dic:
    dic[tmp]=1
  else:
    dic[tmp]+=1
max=0
for i in dic:
  if dic[i]>max:
    max=dic[i]
print(max)

Failing test case input:
5
rpeae
erago
e`qog
gr`pe
rgaqf

Expected output:
5


Actual output:
1


Fixed submission (verdict: Accepted):
N=int(input())
dic={}
for i in range(N):
  tmp=input()
  if tmp not in dic:
    dic[tmp]=1
  else:
    dic[tmp]+=1

print(len(dic))
Problem: p02701
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
N = int(input())
ga = []
for _ in range(N):
    ga.append(input())
print(len(ga))

Failing test case input:
5
egapr
grape
graoe
grape
epaqg

Expected output:
4


Actual output:
5


Fixed submission (verdict: Accepted):
N = int(input())
ga = []
for _ in range(N):
    ga.append(input())
ga = set(ga)
print(len(ga))

Problem: p02701
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
n=int(input())

mydic={"",0}

for i in range(n):
    a=input()
    mydic.update(a)

print(mydic)
print(len(mydic)-2)

Failing test case input:
4
abc`
b
a`b
bb

Expected output:
4


Actual output:
{'', 0, 'b', 'c', 'a', '`'}
4


Fixed submission (verdict: Accepted):
n=int(input())

li = []

for i in range(n):
    a=input()
    li.append((a,i))

di=dict(li)


print(len(di))

Problem: p02701
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
N = int(input())
s = input().split()
print("\n")
print(len(set(s)))

Failing test case input:
3
bpple
orange
apple

Expected output:
3


Actual output:


1


Fixed submission (verdict: Accepted):
N = int(input())
s = [input() for i in range(N)]
print(len(set(s)))

Problem: p02701
Buggy submission (PyPy3 (7.3.0), verdict: Wrong Answer):
from collections import defaultdict

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

print(max(a.values()))

Failing test case input:
5
rpfae
graoe
gaqoe
ep`rg
rgaqe

Expected output:
5


Actual output:
1


Fixed submission (verdict: Accepted):
from collections import defaultdict

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

print(len(a.items()))

Problem: p02701
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
N = int(input()) 
s = [input() for i in range(N)] 
print(len(s))

Failing test case input:
5
grape
grape
grape
grape
grape

Expected output:
1

Actual output:
5


Fixed submission (verdict: Accepted):
N = int(input()) 
s = [input() for i in range(N)] 
print(len(set(s)))

Problem: p02701
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
N = int(input())
S = []
for i in range(N):
    S.append(input())
s = sorted(S)
count = 1
for i in range(2,N):
    if s[i] != s[i-1]:
        count += 1
print(count)

Failing test case input:
4
acb`
a
_ba
aa

Expected output:
4


Actual output:
3


Fixed submission (verdict: Accepted):
N = int(input())
S = []
for i in range(N):
    S.append(input())
s = sorted(S)
count = 1
for i in range(1,N):
    if s[i] != s[i-1]:
        count += 1
print(count)

Problem: p02701
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
N=int(input())
S=[input() for _ in range(N)]
print(len(S))

Failing test case input:
5
egapr
grape
graoe
grape
epaqg

Expected output:
4


Actual output:
5


Fixed submission (verdict: Accepted):
N=int(input())
S=[input() for _ in range(N)]
print(len(set(S)))
Problem: p02701
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
K = int(input())
L = []
for i in range(1,K+1):
    t =input()
    L.append(t)
print(len(L))

Failing test case input:
5
grape
grape
graoe
grape
eparg

Expected output:
3


Actual output:
5


Fixed submission (verdict: Accepted):
K = int(input())
L = []
for i in range(1,K+1):
    t =input()
    L.append(t)
S = set(L)
print(len(S))

Problem: p02701
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
from collections import Counter
N = int(input())
s = [input() for i in range(N)]
print(len(s))

Failing test case input:
3
apple
orange
apple

Expected output:
2

Actual output:
3


Fixed submission (verdict: Accepted):
from collections import Counter
N = int(input())
s = [input() for i in range(N)]
c = Counter(s)
print(len(c))

Problem: p02701
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
N = int(input())
S = []

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

Failing test case input:
3
apple
orange
apple

Expected output:
2

Actual output:
3


Fixed submission (verdict: Accepted):
N = int(input())
S = []

for i in range(N):
  S.append(input())
S= set(S)
print(len(S))

Problem: p02701
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
n = int(input())
s_list = []
for i in range(n):
    temp = input()
    s_list.append(temp)

len(set(s_list))

Failing test case input:
3
flppa
fgamrn
appld

Expected output:
3


Actual output:

Fixed submission (verdict: Accepted):
n = int(input())
s_list = []
for i in range(n):
    temp = input()
    s_list.append(temp)

print(len(set(s_list)))

Problem: p02701
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
a, lists = int(input()), list(map(str, input().split()))
print(len(list(set(lists))))

Failing test case input:
5
eagpr
grape
gqaoe
ep`rg
epaqg

Expected output:
5


Actual output:
1


Fixed submission (verdict: Accepted):
a, lists = int(input()), []
for x in range(a):
    lists.append(input())
print(len(list(set(lists))))

Problem: p02701
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
N = input()
list = list(input())
print(len(set(list)))

Failing test case input:
4
`caa
`
aab
aa

Expected output:
4


Actual output:
3


Fixed submission (verdict: Accepted):
N = int(input())
list = [input() for i in range(N)]
print(len(set(list)))

Problem: p02701
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
import collections
num = int(input())
a = input().split()
clist = collections.Counter(a)
print(len(clist))

Failing test case input:
3
flooa
fgarnm
aplpd

Expected output:
3


Actual output:
1


Fixed submission (verdict: Accepted):
import collections
num = int(input())
a = [input() for i in range(num)]
clist = collections.Counter(a)
print(len(clist))

Problem: p02701
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
n = int(input())
items = [x for x in input().split()]

print(len(set(items)))

Failing test case input:
5
eagpr
grape
graoe
ep`rg
epaqf

Expected output:
5


Actual output:
1


Fixed submission (verdict: Accepted):
n = int(input())
items = [input() for _ in range(n)]

print(len(list(set(items))))
Problem: p02701
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
N = int(input())
S = []
for i in range(N):
    S.append(input())

kind = 1
S.sort()
s_old = S[0]
for i in range(1,N):
    if S[i] != s_old:
        kind += 1

print(kind)


Failing test case input:
5
geapr
grape
graoe
grape
epaqg

Expected output:
4


Actual output:
5


Fixed submission (verdict: Accepted):
N = int(input())
S = []
for i in range(N):
    S.append(input())

kind = 1
S.sort()
s_old = S[0]
for i in range(1,N):
    if S[i] != s_old:
        kind += 1
    s_old = S[i]

print(kind)

Problem: p02701
Buggy submission (PyPy3 (7.3.0), verdict: Wrong Answer):
N = int(input())
S = [input() for i in range(N)]
s = set(S)
print(s)

Failing test case input:
4
acb`
a
ab_
ab

Expected output:
4


Actual output:
{'acb`', 'ab_', 'ab', 'a'}


Fixed submission (verdict: Accepted):
N = int(input())
S = [input() for i in range(N)]
s = set(S)
print(len(s))

Problem: p02701
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
N = int(input())
str_list = sorted(list(input() for _ in range(N)))
str_set = list(set(str_list))
print(str_set)
l = len(str_set)
print(l)

Failing test case input:
4
`caa
b
b`a
bb

Expected output:
4


Actual output:
['b`a', '`caa', 'b', 'bb']
4


Fixed submission (verdict: Accepted):
N = int(input())
str_list = sorted(list(input() for _ in range(N)))
str_set = list(set(str_list))
l = len(str_set)
print(l)

Problem: p02701
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
import sys
from collections import Counter


def main():
  scan = sys.stdin.readline
  
  n = int(scan().rstrip())
  s = scan().rstrip().split()
  
  print(len(Counter(s)))


if __name__ == "__main__":
  main()


Failing test case input:
5
eaepr
eqago
e`qog
gr`pe
rgbrf

Expected output:
5


Actual output:
1


Fixed submission (verdict: Accepted):
import sys
from collections import Counter


def main():
  scan = sys.stdin.readline
  
  n = int(scan().rstrip())
  s = [scan().rstrip() for _ in range(n)]
  
  print(len(Counter(s)))


if __name__ == "__main__":
  main()

Problem: p02701
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
N = int(input())
prizes = set()
unique = 0
for _ in range(N):
    curr = input()
    if not prizes:
        unique += 1
        prizes.add(curr)
    if curr not in prizes:
        unique += 1
print(unique)

Failing test case input:
5
geapr
grape
graoe
grape
epaqg

Expected output:
4


Actual output:
5


Fixed submission (verdict: Accepted):
N = int(input())
prizes = set()
unique = 0
for _ in range(N):
    curr = input()
    if not prizes:
        unique += 1
        prizes.add(curr)
    if curr not in prizes:
        prizes.add(curr)
        unique += 1
print(unique)

Problem: p02701
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
n = int(input())
ls = []
for x in range(n):
    ls.append(input())
    print(len(set(ls)))

Failing test case input:
3
flooa
fgaqnm
dplpa

Expected output:
3


Actual output:
1
2
3


Fixed submission (verdict: Accepted):
n = int(input())
ls = []
for x in range(n):
    ls.append(input())
print(len(set(ls)))
Problem: p02701
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
n=int(input())
list=[]
for _ in range(n):
    s=input()
    if s in list:
        pass
    else:
        list.append(s)
print(str(len(s)))

Failing test case input:
3
applf
orangf
appld

Expected output:
3


Actual output:
5


Fixed submission (verdict: Accepted):
n=int(input())
set=set()
for _ in range(n):
    s=input()
    if s not in set:
        set.add(s)
print(str(len(set)))

Problem: p02701
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
import sys;


class Main:
    s = set([i.strip() for i in sys.stdin.readlines()]);

    print(len(s));



Failing test case input:
3
flooa
fgaqnm
aplpd

Expected output:
3


Actual output:
4


Fixed submission (verdict: Accepted):



class Main:
    N = int(input());
    s = set([input() for i in range(N)]);
    print(len(s))

Problem: p02701
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
n = int(input())
c = []
cou = 1
for i in range(n):
  c.append(input())

set(c)
  
print(len(c))

Failing test case input:
5
grape
grape
grape
grape
grape

Expected output:
1

Actual output:
5


Fixed submission (verdict: Accepted):
n = int(input())
c = []
for i in range(n):
  c.append(input())

print(len(list(set(c))))

Problem: p02701
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
i = int(input())
lists = []
for j in range(i):
    lists.insert(j, str(input()))

print(lists)
print(len(set(lists)))

Failing test case input:
3
apolf
fganrm
aqlpd

Expected output:
3


Actual output:
['apolf', 'fganrm', 'aqlpd']
3


Fixed submission (verdict: Accepted):
N = int(input())
lists = []
for i in range(N):
    lists.append(input())
set_S = list(set(lists))
print(len(set_S))

Problem: p02701
Buggy submission (PyPy3 (7.3.0), verdict: Wrong Answer):
import sys

stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip() 

def main():
    n = ni()
    s = [ns() for i in range(n)]
    st = tuple(s)
    print(len(st))
    return

if __name__ == '__main__':
  main()

Failing test case input:
5
grape
grape
graoe
grape
eparg

Expected output:
3


Actual output:
5


Fixed submission (verdict: Accepted):
import sys

stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip() 

def alpha2num(alpha):
    num=0
    for index, item in enumerate(list(alpha)):
        num += pow(26,len(alpha)-index-1)*(ord(item)-ord('A')+1)
    return num
    
def main():
    n = ni()
    s = set([alpha2num(ns()) for i in range(n)])
    print(len(s))
    return

if __name__ == '__main__':
  main()

Problem: p02701
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
N = int(input())
r = set()
for i in range(N):
    r |= set(input())

print(len(r))

Failing test case input:
5
eagpr
grape
gqaoe
ep`rg
gqape

Expected output:
5


Actual output:
8


Fixed submission (verdict: Accepted):
N = int(input())
r = set()
for i in range(N):
    r |= set([input()])

print(len(r))
Problem: p02701
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
N=int(input())
a=[0]*(N+2)
c=0
for i in range (N):
    S=input()
    a[i]=S
c=len(set(a))
print(c)


Failing test case input:
3
apple
fgnaro
appld

Expected output:
3


Actual output:
4


Fixed submission (verdict: Accepted):
N=int(input())
a=[0]*(N)
c=0
for i in range (N):
    S=input()
    a[i]=S
c=len(set(a))
print(c)

Problem: p02701
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
N=int(input())
S=[]
count=0
for i in range(N):
    sample=input()
    S.append(sample)

set(S)

    
    
print(len(S))

Failing test case input:
5
grape
grape
graoe
grape
grape

Expected output:
2


Actual output:
5


Fixed submission (verdict: Accepted):
N=int(input())
S=[]
count=0
for i in range(N):
    sample=input()
    S.append(sample)



    
    
print(len(set(S)))

Problem: p02701
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
N = int(input())
l = []
for i in range(N):
    l.append(input())
k = sorted(l)
ans = 0
for i in range(N):
    a = 0
    if k[i]!=a:
        ans+= 1
        a = k[i]
print(ans)

Failing test case input:
5
egapr
grape
graoe
grape
epaqg

Expected output:
4


Actual output:
5


Fixed submission (verdict: Accepted):
N = int(input())
l = []
for i in range(N):
    l.append(input())
k = sorted(l)
ans = 0
a = 0
for i in range(N):
    if k[i]!=a:
        ans+= 1
        a = k[i]
print(ans)

Problem: p02701
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
n = int(input())
A = [input() for i in range(n)]
print(len(A) - len(set(A)) + n)

Failing test case input:
5
geapr
grape
graoe
grape
epaqg

Expected output:
4


Actual output:
6


Fixed submission (verdict: Accepted):
n = int(input())
A = [input() for i in range(n)]
print(-len(A) + len(set(A)) + n)

Problem: p02701
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
lotteries = []
num_of_lot = 0
num = int(input())

for i in range(num):
    lotteries.append(input())

num_of_lot = len(set(lotteries))

Failing test case input:
3
flppa
fgmarn
appld

Expected output:
3


Actual output:

Fixed submission (verdict: Accepted):
lotteries = []
num_of_lot = 0
num = int(input())

for i in range(num):
    lotteries.append(input())

num_of_lot = len(set(lotteries))
print(num_of_lot)

Problem: p02701
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
p = input() .split()
s = set()
for i in range(1, len(p)):
    s.add(p[i])
print(len(set(s)))

Failing test case input:
3
flooa
fgaqnm
dplpa

Expected output:
3


Actual output:
0


Fixed submission (verdict: Accepted):
n = int(input())
p = [input() for i in range(n)]
s = set()
for i in range(n):
    s.add(p[i])
print(len(s))

Problem: p02701
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
N = int(input())

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

d = {}
for item in items:
  if item not in d:
    d[item] = True
    print(item)
  


Failing test case input:
3
applf
nrangf
appld

Expected output:
3


Actual output:
applf
nrangf
appld


Fixed submission (verdict: Accepted):
N = int(input())

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

d = {}
for item in items:
    d[item] = True
    
print(len(d))
Problem: p02701
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
N = int(input())
l = []
for i in range(N):
    l.append(input())
k = sorted(l)
ans = 0
for i in range(N):
    a = 0
    if l[i]!=a:
        ans+= 1
        a = l[i]
print(ans)

Failing test case input:
5
geapr
grape
graoe
grape
epaqg

Expected output:
4


Actual output:
5


Fixed submission (verdict: Accepted):
N = int(input())
l = []
for i in range(N):
    l.append(input())
k = sorted(l)
ans = 0
a = 0
for i in range(N):
    if k[i]!=a:
        ans+= 1
        a = k[i]
print(ans)

Problem: p02701
Buggy submission (Python (3.8.2), verdict: Wrong Answer):

kaisuu = int(input())
getprizelist = {}
for i in range(kaisuu):
    keihin = input()
    if keihin not in getprizelist:
        getprizelist[i] = keihin
print(len(getprizelist))


Failing test case input:
5
grape
grape
graoe
grape
eparg

Expected output:
3


Actual output:
5


Fixed submission (verdict: Accepted):

kaisuu = int(input())
getprizelist = {}
for i in range(kaisuu):
    keihin = input()
    if keihin not in getprizelist:
        getprizelist[keihin] = i
print(len(getprizelist))

Problem: p02701
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
N=int(input())
A=set(input().split())
print(len(A))
 

Failing test case input:
5
eagpr
grape
gaqoe
ep`rg
gqape

Expected output:
5


Actual output:
1


Fixed submission (verdict: Accepted):
N=int(input())
A=set(input() for i in range(N))
print(len(A))

Problem: p02701
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
from collections import Counter

n = int(input())
s = [str(e) for e in input().split()]
print(len(Counter(s)))

Failing test case input:
4
a`aa
a
aaa
aa

Expected output:
4


Actual output:
1


Fixed submission (verdict: Accepted):
from collections import Counter

n = int(input())
s = []
for _ in range(n):
    s.append(input())
print(len(Counter(s)))

Problem: p02701
Buggy submission (Python (3.8.2), verdict: Wrong Answer):

i = int(input())
lists = []
for j in range(i):
    lists.insert(j, str(input()))

print(lists)
print(len(set(lists)))


Failing test case input:
5
geapr
grape
graoe
grape
epaqg

Expected output:
4


Actual output:
['geapr', 'grape', 'graoe', 'grape', 'epaqg']
4


Fixed submission (verdict: Accepted):
N = int(input())
lists = []
for i in range(N):
    lists.append(input())
set_S = list(set(lists))
print(len(set_S))

Problem: p02701
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
n = int(input())
lis = []
for i in range(n):
  i = str(input())
  ilen = len(i)
  lis.append(ilen)
  
lisa = set(lis)
kind = int(len(lisa))
print(kind)


Failing test case input:
3
bpple
egnaro
appld

Expected output:
3


Actual output:
2


Fixed submission (verdict: Accepted):
n = int(input())
lis = set()
for i in range(n):
  i = str(input())
  lis.add(i)
  
kind = int(len(lis))
print(kind)
Problem: p02701
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
n = int(input())
s = []
for i in range(n):
  s.append(input())
s.sort()
print(len(s))

Failing test case input:
5
grape
grape
graoe
grape
epaqg

Expected output:
3


Actual output:
5


Fixed submission (verdict: Accepted):
n = int(input())
s = []
for i in range(n):
  s.append(input())
print(len(set(s)))

Problem: p02701
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
N = int(input())
S = [input() for _ in range(N)]

S_set = list(set(S))



print(len(S))


Failing test case input:
5
geapr
grape
graoe
grape
epaqg

Expected output:
4


Actual output:
5


Fixed submission (verdict: Accepted):
N = int(input())
S = [input() for _ in range(N)]

S_set = list(set(S))



print(len(S_set))

Problem: p02701
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
n = int(input())
s = [input() for i in range(n)]
len(set(s))

Failing test case input:
3
bpple
orange
apple

Expected output:
3


Actual output:

Fixed submission (verdict: Accepted):
n = int(input())
s = [input() for i in range(n)]
print(len(set(s)))

Problem: p02701
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
numOfStr= int(input())
strlist = []
total = 0
for i in range(0,numOfStr):
    strlist.append(input())
strlist.sort()
for i in range(1,numOfStr):
    if strlist[i] != strlist[i-1]:
        total += 1
print(total)

Failing test case input:
3
flopa
fgamrn
aqpld

Expected output:
3


Actual output:
2


Fixed submission (verdict: Accepted):
numOfStr= int(input())
strlist = []
total = 1
for i in range(0,numOfStr):
    strlist.append(input())
strlist.sort()
for i in range(1,numOfStr):
    if strlist[i] != strlist[i-1]:
        total += 1
print(total)

Problem: p02701
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
N = int(input())
S = [input() for i in range(N)]
print(len(S))

Failing test case input:
3
apple
orange
apple

Expected output:
2

Actual output:
3


Fixed submission (verdict: Accepted):
N = int(input())
S = set([input() for i in range(N)])
print(len(S))

Problem: p02701
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
n = int(input())
counter = 0
s = "TEMP"
list = []

while n > 0:
  s = input()
  list.append(s)
  counter = 0
  for item in list:
    if item == s:
      counter = counter - 1
    counter = counter + 1
  n = n - 1

print(counter)

Failing test case input:
3
apple
egnaro
appld

Expected output:
3


Actual output:
2


Fixed submission (verdict: Accepted):
n = int(input())
counter = 0
s = "TEMP"
list = []
temp = ''

while n > 0:
  s = input()
  list.append(s)
  n = n - 1

list.sort()
for item in list:
  if item == temp:
    counter = counter - 1
  counter = counter + 1
  temp = item

print(counter)

Problem: p02701
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
n = int(input())
ls = []
count = 0
for x in range(n):
    ls.append(input())
set(ls)
print(len(ls))

Failing test case input:
3
apple
orange
apple

Expected output:
2

Actual output:
3


Fixed submission (verdict: Accepted):
n = int(input())
ls = []
count = 0
for x in range(n):
    ls.append(input())
ls = set(ls)
print(len(ls))