Buggy python submission (verdict: Time Limit Exceeded):
N=int(input())
Ins=[]
ans=0
for i in range(N):
    S=input()
    if not S in Ins:
        ans+=1
        Ins.append(S)
print(ans)


Fixed submission:
import collections
N=int(input())
S=[]
for i in range(N):
    S.append(input())
s=collections.Counter(S)
s_key=s.keys()
print(len(s_key))

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = [input() for i in range(n)] 

ans = 1
s = [a[0]]
 
for i in a[1:]:
    if i in s:
        continue
    else:
        ans += 1
        s.append(i)

print(ans) 

Fixed submission:
import collections
N=int(input())
S=[]
for i in range(N):
    S.append(input())
s=collections.Counter(S)
s_key=s.keys()
print(len(s_key))

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = [input() for i in range(n)] 
ans = 1
s = [a[0]]
 
for i in a[1:]:
    if not i in s:
        ans += 1
        s.append(i)
print(ans) 

Fixed submission:
import collections
N=int(input())
S=[]
for i in range(N):
    S.append(input())
s=collections.Counter(S)
s_key=s.keys()
print(len(s_key))

Buggy python submission (verdict: Runtime Error):
n = int(input())
a = [input() for i in range(n)] 
ans = 1
s = [a[0]]
 
for i in a[1:]:
    if not i in s:
        ans += 1
        s.append(i)
print(ans) 

Fixed submission:
import collections
N=int(input())
S=[]
for i in range(N):
    S.append(input())
s=collections.Counter(S)
s_key=s.keys()
print(len(s_key))

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = [input() for i in range(n)] 
ans = 1
s = [a[0]]
 
for i in a[1:]:
    if not i in s:
        ans += 1
        s.append(i)
print(ans) 

Fixed submission:
import collections
N=int(input())
S=[]
for i in range(N):
    S.append(input())
s=collections.Counter(S)
s_key=s.keys()
print(len(s_key))

Buggy python submission (verdict: Runtime Error):
n = int(input())
a = [input() for i in range(n)] 
ans =1
s = [a[0]]
 
for i in a[1:]:
    if not i in s:
        ans += 1
        s.append(i)
print(ans)

Fixed submission:
import collections
N=int(input())
S=[]
for i in range(N):
    S.append(input())
s=collections.Counter(S)
s_key=s.keys()
print(len(s_key))

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = [input() for i in range(n)] 
ans =1
s = [a[0]]
 
for i in a[1:]:
    if not i in s:
        ans += 1
        s.append(i)
print(ans)

Fixed submission:
import collections
N=int(input())
S=[]
for i in range(N):
    S.append(input())
s=collections.Counter(S)
s_key=s.keys()
print(len(s_key))

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = [input() for i in range(n)] 
ans =1
s = [a[0]]
 
for i in a[1:]:
    if not i in s:
        ans += 1
        s.append(i)
print(ans) 

Fixed submission:
import collections
N=int(input())
S=[]
for i in range(N):
    S.append(input())
s=collections.Counter(S)
s_key=s.keys()
print(len(s_key))

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = [input() for i in range(n)] 
ans =1
s = [a[0]]

for i in a[1:]:
    if not i in s:
        ans += 1
        s.append(i)
    else:
        continue
print(ans)    


Fixed submission:
import collections
N=int(input())
S=[]
for i in range(N):
    S.append(input())
s=collections.Counter(S)
s_key=s.keys()
print(len(s_key))

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = [input() for i in range(n)] 
ans =1
s = []
s.append(a[0])
for i in a[1:]:
    if i in s:
        continue
    else:
        ans += 1
        s.append(i)


print(ans)    


Fixed submission:
import collections
N=int(input())
S=[]
for i in range(N):
    S.append(input())
s=collections.Counter(S)
s_key=s.keys()
print(len(s_key))