Buggy python submission (verdict: Runtime Error):
N=int(input())
A=list(map(int,input().split()))
B=A.copy()
counter=0
for num in range(N-2):
  if A[num] in B:
    counter+=1
    while A[num] in B:
      B.remove(A[num])
  
print(counter)

Fixed submission:
N=int(input())
z=[]
for num in range(101):
  z.append(0)
counter=0
while counter < N:
  d=int(input())
  z[d]=1
  counter+=1
result=sum(z)
print(result)

Buggy python submission (verdict: Runtime Error):
N=int(input())
A=list(map(int,input().split()))
B=A.copy()
counter=0
for num in range(N-1):
  if A[num] in B:
    counter+=1
    while A[num] in B:
      B.remove(A[num])
  
print(counter)

Fixed submission:
N=int(input())
z=[]
for num in range(101):
  z.append(0)
counter=0
while counter < N:
  d=int(input())
  z[d]=1
  counter+=1
result=sum(z)
print(result)

Buggy python submission (verdict: Runtime Error):
N=int(input())
A=list(map(int,input().split()))
B=A.copy()
counter=0
for num in range(N):
  if A[num] in B:
    counter+=1
    while A[num] in B:
      B.remove(A[num])
  
print(counter)

Fixed submission:
N=int(input())
z=[]
for num in range(101):
  z.append(0)
counter=0
while counter < N:
  d=int(input())
  z[d]=1
  counter+=1
result=sum(z)
print(result)

Buggy python submission (verdict: Runtime Error):
N=int(input())
A=list(map(int,input().split()))
B=A.copy()
counter=0
for num in range(N):
  if A[num] in B:
    counter+=1
    while A[num] in B:
      B.remove(A[num])
  else:
    continue
print(counter)

Fixed submission:
N=int(input())
z=[]
for num in range(101):
  z.append(0)
counter=0
while counter < N:
  d=int(input())
  z[d]=1
  counter+=1
result=sum(z)
print(result)

Buggy python submission (verdict: Runtime Error):
N=int(input())
A=list(map(int,input().split()))
B=A.copy()
counter=0
for num in range(N):
  if A[num] in B:
    counter+=1
    while A[num] in B:
      B.remove(A[num])
print(counter)

Fixed submission:
N=int(input())
z=[]
for num in range(101):
  z.append(0)
counter=0
while counter < N:
  d=int(input())
  z[d]=1
  counter+=1
result=sum(z)
print(result)

Buggy python submission (verdict: Runtime Error):
A=list(map(int,input().split()))
count=0
count_sub=0
while len(A) !=0:
  count+=1
  while count_sub < A.count(A[0]):
    A=A.remove(A[0])
    count_sub+=1
print(count)

Fixed submission:
N=int(input())
z=[]
for num in range(101):
  z.append(0)
counter=0
while counter < N:
  d=int(input())
  z[d]=1
  counter+=1
result=sum(z)
print(result)

Buggy python submission (verdict: Runtime Error):
A=list(map(int,input().split()))
count=0
while len(A) !=0:
  count+=1
  while count_sub < A.count(A[0]):
    A=A.remove(A[0])
    count_sub+=1
print(count)

Fixed submission:
N=int(input())
z=[]
for num in range(101):
  z.append(0)
counter=0
while counter < N:
  d=int(input())
  z[d]=1
  counter+=1
result=sum(z)
print(result)

Buggy python submission (verdict: Time Limit Exceeded):
A=list(map(int,input().split()))
count=0
while len(A) !=0:
  count+=1
  while count < A.count(A[0]):
    A=A.remove(A[0])
print(count)

Fixed submission:
N=int(input())
z=[]
for num in range(101):
  z.append(0)
counter=0
while counter < N:
  d=int(input())
  z[d]=1
  counter+=1
result=sum(z)
print(result)