Problem:


Score : 300 points

Problem Statement

You drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.

How many kinds of items did you get?

Constraints

1 \leq N \leq 2\times 10^5

S_i consists of lowercase English letters and has a length between 1 and 10 (inclusive).

Input

Input is given from Standard Input in the following format:

N
S_1
:
S_N

Output

Print the number of kinds of items you got.

Sample Input 1

3
apple
orange
apple

Sample Output 1

2

You got two kinds of items: apple and orange.

Sample Input 2

5
grape
grape
grape
grape
grape

Sample Output 2

1

Sample Input 3

4
aaaa
a
aaa
aa

Sample Output 3

4



Sample input:
3
apple
orange
apple


Sample output:
2

Submission status: Time Limit Exceeded

Solution code:
n=int(input())
l=[]
index=1
l.append(input())

for i in range(n-1):
  tmp=input()
  flg=0
  for j in range(index):
    if(l[j]==tmp):
      flg=1
      break
  if(flg==0):
    l.append(tmp)
    index=index+1
  #print(i,index)

print(index)

Submission status: Time Limit Exceeded

Solution code:
#coding:utf-8

n = int(input())
l = []

for i in range(n):
    s = str(input())
    if s not in l:
        l.append(s)

ans = len(l)

print("{}".format(ans))

Submission status: Time Limit Exceeded

Solution code:
n = int(input().rstrip())

sa = []
for i in range(n):
    line = input().rstrip()
    f = True
    for s in sa:
        if s == line:
            f = False
            break
    
    if f == True:
        sa.append(line)

print(len(sa))

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
S_list = [[_ for _ in input()] for i in range(N)]

gift = []
for i_s in S_list:
    if not i_s in gift:
        gift.append(i_s)

print(len(gift))

Submission status: Time Limit Exceeded

Solution code:
import sys
input = sys.stdin.readline

n = int(input())

Li = [None]*n
for i in range(n):
    s = input()
    if s in Li:
        pass
    else:
        Li[i] = s

Li = [e for e in Li if e is not None]
print(len(Li))

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
s = []
for _ in range(n):
    s.append(input())
lis = []
for i in s:
    if i in lis:
        continue
    else:
        lis.append(i)

print(len(lis))

Submission status: Time Limit Exceeded

Solution code:
from sys import stdin


def get_result(data):
    _ = data[0][0]
    A = data[1:]
    return len(set(sum(A, [])))


if __name__ == '__main__':
    raw_data = [val.rstrip() for val in stdin.readlines()]
    data = [list(map(str, val.split(' '))) for val in raw_data]
    result = get_result(data)
    print(result)

Submission status: Time Limit Exceeded

Solution code:
num=int(input())
list=[[] for i in range(10)]
count=0
for i in range(num):
  a=input()
  la=len(a)
  if a not in list[la-1]:
    list[la-1].append(a)
    count+=1
print(count)

Submission status: Time Limit Exceeded

Solution code:
n=int(input())
A=[]
for _ in range(n):
  s=input()
  if s not in A:
    A+=[s]
print(len(A))

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
S = [input() for _ in range(N)]
c = 0
while S != []:
  s = S.pop(0)
  if s in S:
    continue
  else:
    c += 1
print(c)

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
ls = []

for i in range(n):
    s = input()
    if s not in ls:
        ls += [s]

len = len(ls)
print(len)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())

lis = []

for n in range(N):
  s = input()
  if not s in lis:
    lis.append(s)

print(len(lis))

Submission status: Time Limit Exceeded

Solution code:
#A,B,C,D=map(int,input().split(" "))

N=int(input())

S=[]
ans=0

for i in range(N):
  a=input()
  if a in S:
    a=0
  else:
    S.append(a)
    ans += 1
  
print(ans)

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
t = []
for i in range(n):
    a = input()
    if(a in t):
        a = 1
    else:
        t.append(a)
print(len(t))

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
# s_list = [input() for i in range(n)]
s_list = []
for i in range(n):
    s = input()
    if s not in s_list:
        s_list.append(s)
    else:
        pass
    
print(len(s_list))

Submission status: Time Limit Exceeded

Solution code:
# coding: utf-8
# Your code here!
N,= map(int, input().split())
S=[]
su=0
for i in range(N):
    a= input()
    
    if(a in S):
        continue
    S.append(a)
    su+=1
print(su)

Submission status: Time Limit Exceeded

Solution code:
N=int(input())
s_li=[input() for i in range(N)]
ans=0
while(len(s_li)!=0):
    youso=s_li[0]
    s_li=[s for s in s_li if s != youso]
    ans+=1
print(ans)

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
l = []
a = 0
for i in range(n):
  s = input()
  if s not in l:
    l.append(s)
    a = a+1
print(a)

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
ans = []
for _ in range(n):
    s = input()
    if s in ans:
        continue
    ans.append(s)
print(len(ans))

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
li = []
for n in range(N):
    i = input()
    if i in li:
        pass
    else:
        li.append(i)
print(len(li))

Submission status: Time Limit Exceeded

Solution code:
N = int(input())

itemCount = 0
itemList = []

for i in range(N):
  item = input()
  if item not in itemList:
    itemCount += 1
    itemList.append(item)

print(itemCount)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
ans = []
ansnum = 0
for i in range(N):
    s = input()
    if (s in ans) == False:
        ans.append(s)
        ansnum += 1
print(ansnum)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
ans = 0
A=[]

for i in range(N):
    S=input()
    if S in A:
        continue
    else:
        A.append(S)
        ans+=1

print(ans)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
arr = []
for i in range(N):
    A = str(input())
    if A in arr:
        continue
    else:
        arr.append(str(A))

print(len(arr))

Submission status: Time Limit Exceeded

Solution code:
n = int(input())

ans = []

for i in range(n):
  s = input()
  if s in ans:
    pass
  else:
    ans.append(s)

print(len(ans))

Submission status: Time Limit Exceeded

Solution code:
def resolve():
    n = int(input())
    s = []
    for i in range(n):
        d = input()
        if not (d in s):
            s += [d]
    print(len(s))

if __name__ == "__main__":
	resolve()

Submission status: Time Limit Exceeded

Solution code:
N = int(input())

ls = [input()]
count = 1
for i in range(N-1):
    if input() in ls:
        pass
    else:
        ls.append(i)
        count += 1
        
print(count)

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
L=[]
for i in range(n):
	s= input()
	if s not in L:
		L.append(s)

print(len(L))

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
a = []
count = 0
for i in range(n):
  item = input()
  if(item not in a):
    a.append(item)
    count+=1
print(count)

Submission status: Time Limit Exceeded

Solution code:
n=int(input())
a=[]

a.append(str(input()))

for i in range(n-1):
  flag = 1
  tmp = str(input())
  for j in range(len(a)):
    if a[j] == tmp:
      flag = 0
  if flag == 1:
    a.append(tmp)

print(len(a))

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
S = []
for i in range(N):
  moji = input()
  if moji not in S:
    S.append(moji)
  
print(len(S))

Submission status: Time Limit Exceeded

Solution code:
N=int(input())
goods=[]
count=0
for i in range(N):
  s=input()
  tmp=0
  for j in range(len(goods)):
    if goods[j]==s:
      tmp=1
      break
  if tmp==0:
    count+=1
    goods.append(s)
print(count)

Submission status: Time Limit Exceeded

Solution code:
n=int(input())
s=[]
for i in range(0,n):
    a=input()
    if a not in s:
        s.append(a)
print(len(s))

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
list = []
for i in range(N):
  S = input()
  if S not in list:
    list.append(S)
print(len(list))

Submission status: Time Limit Exceeded

Solution code:
N = int(input())

S = []
counter = 0
for i in range(N):
    S.append(input())
    temp = 0
    for j in range(i):
        if S[j] == S[i]:
            temp = 1
            break

    if temp == 0:
        counter += 1
print(counter)

Submission status: Time Limit Exceeded

Solution code:
n=int(input())
a=[]
ans=0
for i in range(n):
    x=input()
    #print(a,x)
    if x not in a:
        ans+=1
        a.append(x)
print(ans)

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
s = [input() for i in range(n)]
o = 0
while len(s)>0:
    ps = s[0]
    x = s.count(ps)
    o += 1
    for i in range(x):
        s.remove(ps)
print(o)

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
oridata = [input() for i in range(n)]
data = [oridata[0]]
key = 0
for i in range(1,n):
    for per in data:
        if(per == oridata[i]):
            key = 1
            break
    if(key == 0):
        data.append(oridata[i])
    else:
        key = 0

print(len(data))

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
gacha_list = []
count = 0
for i in range(N):
    S = input()
    if S not in gacha_list:
        gacha_list.append(S)
        count += 1

print(count)

Submission status: Time Limit Exceeded

Solution code:
num = int(input())
item_list = []
count = 0

for i in range(num):
    item = input()
    # print(item in item_list)
    if (item in item_list) == False:
        item_list.append(item)
        count += 1
        
print(count)

Submission status: Time Limit Exceeded

Solution code:
import sys

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

# アルファベット→数値
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 BinarySearch(num, nums):
    if len(nums) == 0:
        print("Erorr : list has no element")
        return
    left,right = 0,len(nums)
    while left < right:
        mid  = (left+right)//2
        if num < nums[mid]:
            right = mid
        else:
            left = mid + 1
    return right

def main():
    n = ni()
    items = [alpha2num(ns())]
    for i in range(n-1):
        item = alpha2num(ns())
        right = BinarySearch(item,items)
        if items[right-1] != item:
            items = items[:right] + [item] + items[right:]
    print(len(items))
    return
    
if __name__ == '__main__':
  main()

Submission status: Time Limit Exceeded

Solution code:
N=int(input())

S=[input() for _ in range(N)]
b=[]
i=0
for k in S:
  if k not in b:
    i+=1
    b.append(k)
  else:
    continue
print(i)

Submission status: Time Limit Exceeded

Solution code:
n=int(input())
alpha=[chr(i) for i in range(97, 97+26)]
d={i:[] for i in alpha}
ans=0
for _ in range(n):
    s=input()
    if s not in d[s[0]]:
        d[s[0]].append(s)
        ans+=1
print(ans)

Submission status: Time Limit Exceeded

Solution code:
import sys, re
import math
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul	# 
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd	# 最大公約数
from heapq import heappush, heappop

def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7

# -*- coding: utf-8 -*-
n = INT()
list = []

addFlag = True

for x in range(n):
    text = input()
    addFlag = True
    for y in list:
        if text == y:
            addFlag = False
            break
    if addFlag:
        list.append(text)
        
print(len(list))

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
l = []
for i in range(n):
    s = input()
    if not s in l:
        l.append(s)
print(len(l))

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
x = [0]*n
for i in range(n):
    s = input()
    if s in x:
        n -= 1
    else:
        x[i] = s
print(n)

Submission status: Time Limit Exceeded

Solution code:
n = input()
n = int(n)
s = []
for i in range(n):
	x = input()
	if x not in s: s.append(x)
print(len(s))

Submission status: Time Limit Exceeded

Solution code:
from collections import deque
n = int(input())
S = deque([])
for i in range(n):
    s = input()
    if s not in S:
        S.append(s)
print(len(S))

Submission status: Time Limit Exceeded

Solution code:
N =int(input())
keihin =[]
ans = 0
for _ in range(N):
    S = input()
    if S in keihin:
        continue
    else:
        keihin.append(S)
        ans+=1

print(ans)

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
A = []
ans = 0
for i in range(n):
    a = input()
    if a not in A:
        ans += 1
        A.append(a)
print(ans)

Submission status: Time Limit Exceeded

Solution code:
def main():
    n = int(input())
    hoge = []
    res = 0
    for _ in range(n):
        s = input()
        if s not in hoge:
            res += 1
            hoge.append(s)
    print(res)

if __name__ == '__main__':
    main()

Submission status: Time Limit Exceeded

Solution code:
n=int(input())
a=[]
ans=0
for i in range(n):
  aa=str(input())
  if aa in a:
    b=0
  else:
    a.append(aa)
    ans+=1
print(ans)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
S = [input() for i in range(N)]

gacha_list = []
for i in S:
    if i not in gacha_list:
        gacha_list.append(i)

print(len(gacha_list))

Submission status: Time Limit Exceeded

Solution code:
n=int(input())
s=[]
a=[]
for i in range(0,n):
    s.append(input())
for i in range(0,n):
    if s[i] not in a:
        a.append(s[i])
print(len(a))

Submission status: Time Limit Exceeded

Solution code:
def lottery(a):
  return len(a)

n = int(input())
a = []
for i in range(n):
  item = input()
  if(item not in a):
    a.append(item)
print(lottery(a))

Submission status: Time Limit Exceeded

Solution code:
num=int(input())
list=[]
for i in range(num):
  a=input()
  if a not in list:
    list.append(a)
print(len(list))

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
table = []
for i in range(n):
    s = input()
    if s not in table:
        table.append(s)
print(len(table))

Submission status: Time Limit Exceeded

Solution code:
def resolve():
    n = int(input())
    s = []
    for i in range(n):
        d = input()
        if not (d in s):
            s += [d]
    print(len(s))
resolve()

Submission status: Time Limit Exceeded

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

got = []

for i in range(n):
    if s[i] not in got:
        got += [s[i]]

print(len(got))

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
items = []
count = 0
for i in range(n):
    item = input()
    if item not in items:
        items.append(item)
        count += 1
    else:
        pass
print(count)

Submission status: Time Limit Exceeded

Solution code:
import math

n = int(input())
s = []
for i in range(n):
	tmp = input()
	if tmp not in s:
		s.append(tmp)

print(len(s))

Submission status: Time Limit Exceeded

Solution code:
N=int(input())
a=[]
s=0
for i in range(N):
  b=input()
  if b not in a:
    s+=1
    a.append(b)
print(s)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
S = []
for i in range(N):
    s = input()
    if not(s in S):
        S.append(s)

print(len(S))

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
s = []
for i in range(n):
    s.append(str(input()))
prize = []
for  j in range(n):
    if not(s[j] in prize):
        prize.append(s[j])
print(len(prize))

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
L = []
for i in range(N):
    S = input()
    if not(S in L):
        L.append(S)

#print(L)
print(len(L))

Submission status: Time Limit Exceeded

Solution code:
#A,B,C,D=map(int,input().split(" "))

N=int(input())

S=[]

for i in range(N):
  a=input()
  if a in S:
    a=0
  else:
    S.append(a)
ans=len(S)
  
print(ans)

Submission status: Time Limit Exceeded

Solution code:
def f(S):
    T=[]
    a=0
    for i in range(len(S)):
        if S[i] not  in T:
            a+=1
            T.append(S[i])
    return a
N=int(input())
S=[0]*N
for i in range(N):
    S[i]=input()
print(f(S))

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
L = []
count = 0
for i in range(N):
    S = input()
    if not S in L:
        L.append(S)
        count += 1
print(count)

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
l = []
for i in range(n):
  s = input()
  if s not in l:
    l.append(s)
print(len(l))

Submission status: Time Limit Exceeded

Solution code:
N=int(input())
S=[]
for i in range(N):
    a = input()
    if not a in S:
        S.append(a)
print(len(S))

Submission status: Time Limit Exceeded

Solution code:
n=int(input(''))
s=[]
for a in range(n):
    t=input('')
    if t in s:
        p=0
    else:
        s.append(t)

print(len(s))

Submission status: Time Limit Exceeded

Solution code:
N = int(input())

keihin = []

for i in range(N):
    s = input()
    if s in keihin:
        pass
    else:
        keihin.append(s)
    
print(len(keihin))

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
s_list = []
for i in range(n):
    s_list.append(input())
#print(s_list)
ans = []
for s in s_list:
    if not s in ans:
        ans.append(s)
print(len(ans))

Submission status: Time Limit Exceeded

Solution code:
import sys
input = sys.stdin.readline

n = int(input())

Li = []
for i in range(n):
    s = input()
    if s in Li:
        pass
    else:
        Li.append(s)

print(len(Li))

Submission status: Time Limit Exceeded

Solution code:
N = int(input())

keihin = []
for i in range(N) :
  s = input()
  if s in keihin :
    continue
  keihin.append(s)
print(len(keihin))

Submission status: Time Limit Exceeded

Solution code:
"""
くじ引きを N 回行い、i 回目には種類が文字列 Si

で表される景品を手に入れました。

何種類の景品を手に入れましたか？
"""
n=int(input())
a=[]
for ii in range(n):
	s=input()
	if s in a:
	    pass
	else:
	    a.append(s)
#print(a)
print(len(a))

Submission status: Time Limit Exceeded

Solution code:
n=int(input())
a=[]
for i in range(n):
    a.append(input())
a=sorted(set(a),key=a.index)
print(int(len(a)))

Submission status: Time Limit Exceeded

Solution code:
N=int(input())
lis=[]
ans=0
for i in range(N):
    s=input()
    if not s in lis:
        ans+=1
        lis.append(s)
print(ans)

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
res = []

for i in range(n):
    s = str(input())
    if (s in res) == False:
        res.append(s)

print(len(res))

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
l = []
for i in range(n):
    s = input()
    if s not in l:
        l.append(s)
print(len(l))

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
text = []
for i in range(n):
  s = input()
  if s not in text:
    text.append(s)
print(len(text))

Submission status: Time Limit Exceeded

Solution code:
import sys
input = sys.stdin.readline

def main():
    n = int(input())

    s_li = []

    for i in range(n):
        s_i = input()
        if s_i in s_li:
            continue
        else:
            s_li.append(s_i)

    print(len(s_li))


if __name__ == '__main__':
    main()

Submission status: Time Limit Exceeded

Solution code:
n = int(input())

l = []
for _ in range(n):
    s = input()
    if not s in l:
        l.append(s)
        
print(len(l))

Submission status: Time Limit Exceeded

Solution code:
def gacha():
    N=int(input())
    string=[]
    result_list=[]
    for i in range(0,N):
        s=input()
        string.append(s)
    for i in string:
        if i not in result_list:
            result_list.append(i)
    print(len(result_list))

if __name__=="__main__":
    gacha()

Submission status: Time Limit Exceeded

Solution code:
N=int(input())
P = []
for _ in range(N):
    prize = input()
    if not prize in P:
        P.append(prize)
print(len(P))

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
s = []
for _ in range(n):
    s.append(input())
p = []
ans = 0
for i in range(n):
    if s[i] in p:
        pass
    else:
        p.append(s[i])
        ans += 1
print(ans)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
S = []
for _ in range(N):
    S.append(input())

char_list = []
for s in S:
    if s not in char_list:
        char_list.append(s)

print(len(char_list))

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
l = []
c = 0
for i in range(n):
    s = input()
    if s not in l:
        l.append(s)
        c += 1
print(c)

Submission status: Time Limit Exceeded

Solution code:
# import math
# import numpy as np
# import itertools
# import heapq
# =map(int,input().split())
n=int(input())
ans=0
q=[]
for i in range(n):
    x=input()
    if x not in q:
        ans+=1
    q.append(x)
print(ans)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
S = []
for i in range(N):
    temp = input()
    if temp not in S:
        S.append(temp)
print(len(S))

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
S = []
for i in range(N):
    Si = input()
    if Si not in S:
        S.append(Si)
print(len(S))

Submission status: Time Limit Exceeded

Solution code:
N = int(input())

syurui = []
for i in range(N):
    S = input()
    if S in syurui: continue
    else: syurui.append(S)

print(len(syurui))

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
S = [str(input()) for _ in range(N)]

list = []
cnt = 0
for item in S:
	if item not in list:
		cnt += 1
		list.append(item)
print(cnt)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
ans = []

for _ in range(N):
    s = input()
    if s not in ans:
        ans.append(s)
print(len(ans))

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
collections = []
ans = 0

for _ in range(n):
  s = input()
  if s in collections:
    continue
  ans += 1
  collections.append(s)

print(ans)

Submission status: Time Limit Exceeded

Solution code:
N=int(input())

S=[]
for i in range(N):
	x=input()
	if x not in S:
		S.append(x)

print(len(S))

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
ans = []
for i in range(N):
    S = input()
    if S not in ans: ans.append(S)
print(len(ans))

Submission status: Time Limit Exceeded

Solution code:
n = int(input())

l = []
for i in range(n):
    string = input()
    if string not in l:
        l.append(string)

print(len(l))

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
l = []
for i in range(n):
  s = input()
  if s not in l:
    l.append(s)
    
print(len(l))

Submission status: Time Limit Exceeded

Solution code:
#!/usr/bin/env/ python3
#S = input()
N = int(input())
#A, B, C = input().split()
#N, M = map(int, input().split())

#N = int(input())
#A = [int(x) for x in input().split()]

#H, W = map(int, input().split())
S = []
count = 0
for i in range(N):
    tmp = input()
    if tmp not in S:
        count += 1
        S.append(tmp)
print(count)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
ans = []
for i in range(N):
    s = input()
    if (s in ans) == False:
        ans.append(s)
print(len(ans))

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
list = []
for i in range(n):
  s = input()
  list.append(s)
  set_list = set(list)

print(len(set_list))

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
S = [input() for i in range(n)]
ans = []
cnt = 0
for i in range(n):
    if S[i] not in ans:
        ans.append(S[i])
        cnt += 1

print(cnt)

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
s = []
for _ in range(n):
    x = input()
    if not x in s:
        s.append(x)
print(len(s))

Submission status: Time Limit Exceeded

Solution code:

import  numpy as np

arr = np.array([])
N = int(input())
for _ in range(N):
  arr = np.append(arr,input())
  
print(len(np.unique(arr)))

Submission status: Time Limit Exceeded

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

l = []
c=0
for i in s:
    if i not in l:
        l.append(i)
        c+=1
print(c)

Submission status: Time Limit Exceeded

Solution code:
n = int(input())

ans = []

for _ in range(n):
    s = input()

    if s in ans:
        pass
    else:
        ans.append(s)

print(len(ans))

Submission status: Time Limit Exceeded

Solution code:
def main():
    N = int(input())
    S = []
    for i in range(N):
        s = input()
        if s not in S:
            S.append(s)
    print(len(S))

if __name__ == '__main__':
    main()

Submission status: Time Limit Exceeded

Solution code:
from sys import stdin

def main():
    input = stdin.readline
    n = int(input())
    l = []
    for i in range(n):
        s = input()
        if not s in l:
            l.append(s)

    print(len(l))

if __name__ == '__main__':
    main()

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
ans = []
for i in range(n):
    s = input()
    if not s in ans:
        ans.append(s)
print(len(ans))

Submission status: Time Limit Exceeded

Solution code:
def main():
    n = int(input())

    items = []
    count = 0

    for x in range(n):
        s = input()
        if s not in items:
            items.append(s)
            count += 1

    print(count)


main()

Submission status: Time Limit Exceeded

Solution code:
n=int(input())
a=[]
for i in range(n):
    s=input()
    if s not in a:
        a.append(s)

print(len(a))

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
li = []
for i in range(N):
  tmp = input()
  if tmp not in li:
    li.append(tmp)
print(len(li))

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
items = []
for i in range(N):
    a = str(input())
    if a not in items:
        items.append(a)
print(len(items))

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
S = []
for i in range(N):
    S.append(str(input()))
words = []
for i in range(N):
    if S[i] not in words:
        words.append(S[i])
print(len(words))

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
text = []
cout = 0
for i in range(n):
  s = input()
  if s in text:
    continue
  else:
    text.append(s)
    cout += 1
print(cout)

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
s = [input() for i in range(n)]
get = []
ans = 0
i = 0
while i <= n-1:
    if  not s[i] in get:
        get.append(s[i])
        ans += 1
        i += 1
    else:
        i += 1
print(ans)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
L = []
for n in range(N):
  s = str(input())
  if s not in L:
    L.append(s)
print(len(L))

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
S = []
already = []
ans = 0
for i in range(N):
  temps = input()
  if(temps not in already):
    ans += 1
    already.append(temps)
print(ans)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
ret = []
for i in range(N):
    s = input()
    if s not in ret:
        ret.append(s)
print(len(ret))

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
temp = []
for i in range(N):
    x = input()
    if not x in temp:
        temp.append(x)
print(len(temp))

Submission status: Time Limit Exceeded

Solution code:
N=int(input())
s=[input() for i in range(N)]
kison=[]
ans=0
for youso in s:
    if youso not in kison:
        kison.append(youso)
        ans+=1
    else:
        pass
print(ans)

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
s = []
for i in range(n):
    gift = input()
    if not(gift in s):
        s.append(gift)
print(len(s))

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
memory = []
counter = 0

for i in range(N):
    tmp = input()
    if tmp not in memory:
        counter += 1
        memory.append(tmp)

print(counter)