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

Solution (Python):
import collections

N = int(input())
h = list(input() for x in range(N))
c = collections.Counter(h)
print(len(c))

Solution (Python):
n = int(input())  
str_list = [input() for _ in range(n)]
str_list.sort()
before = None
count = 0
for s in str_list:
  if before != s:
    count = count + 1
  before = s
print(count)

Solution (Python):
N=int(input())
lis=[input() for i in range(N)]
print(len(list(set(lis))))

Solution (Python):
N = int(input())
S = []
for i in range(N):
    S.append(input())
S = set(S)
print(len(S))

Solution (Python):
N = int(input())
list=[]
for i in range(N):
    list.append(input())
result = set(list)

print(len(result))

Solution (Python):
N=int(input())
names=[0]*(N+3)
for i in range(N):
    names[i]=input()
count=list(set(names))
count=len(count[1:])
print(count)

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

Solution (Python):
n = int(input())
dicString = {}
for i in range(n):
    elem = input()
    dicString[f'{elem}']  = 1
count = 0
for elem in dicString.values():
    count += elem
print(count)

Solution (Python):
n=int(input())
li=[]
for i in range(n):
  li.append(input())
l=set(li)
print(len(l))

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

counter = Counter(prise)
print(len(counter))

Solution (Python):
n = int(input())
s = []

for i in range(n):
	s.append(input())

ss = sorted(s)
c = len(s)

for i in range(1,n):
	if ss[i-1] == ss[i]:
		c -= 1

print(c)

Solution (Python):
n = int(input())
s_list = []
for i in range(n):
    temp = input()
    s_list.append(temp)

print(len(set(s_list)))

Solution (Python):
N = int(input())
li = []
count = 0
for n in range(N):
    i = input()
    li.append(i)
print(len(set(li)))

Solution (Python):
n=int(input())
s=set()
for i in range(n):
  s.add(str(input()))
print(len(s))

Solution (Python):
N = int(input())
List = [input() for i in range(N)]

print(len(set(List)))

Solution (Python):
n=int(input())
a=['' for i in range(200005)];
for i in range(n):
    a[i]=input()
a=set(a)
print(len(a)-1)

Solution (Python):
from collections import Counter

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

Solution (Python):
from collections import Counter
n = int(input())
a = [input() for i in range(n)]
counter = Counter(a)
print(len(counter))

Solution (Python):
n=int(input())
print(len(set([input() for i in range(n)])))

Solution (Python):
from collections import Counter
n = int(input())
lst = []
for i in range(n):
    s = input()
    lst.append(s)
print(len(Counter(lst).keys()))

Solution (Python):
N = int(input())
A = [input() for _ in range(N)]

setA = set(A)

print(len(setA))

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

print(len(set(L)))

Solution (Python):
from collections import Counter
N = int(input())
S = [input() for i in range(N)]
number = Counter(S)
print(len(number.keys()))

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

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

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

print(len(set(S)))

Solution (Python):
N = int(input())
lst = []
for _ in range(N):
    lst.append(input())
print(len(set(lst)))

Solution (Python):
a,*b=map(str, open(0).read().split())
s=set(b)
print(min(int(a),len(s)))

Solution (Python):
import numpy as np 
n = int(input())
s = np.empty(n,dtype =object)
for i in range(n):
    s[i] = input()
print(np.unique(s).size)

Solution (Python):

n, = [int(val) for val in input().split()]
gifts = set()
for i in range(n):
    s = input()
    gifts.add(s)

print(len(gifts))

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

b=sorted(s)

a=1
for i in range(n-1):
    if b[i]!=b[i+1]:
        a=a+1
print(a)

Solution (Python):
n = int(input())
s = dict({})
for i in range(n):
    x = input()
    s[x] = 1
print(len(s.keys()))

Solution (Python):
n = int(input())
dic = {}
for i in range(n):
    n = input()
    dic[n] = dic.get(n, 0) + 1
print(len(dic.keys()))

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

s = [input() for i in range(n)]

l = list(set(s))

print(len(l))

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

S_set = list(set(S))



print(len(S_set))

Solution (Python):

import collections
N = int(input())

X = []
ans = 0
for i in range(N):
    S = str(input())
    X.append(S)
Y = collections.Counter(X)
print(len(Y))

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

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

s = set(S)
count = 0
for i in range(len(s)):
    count = count + 1
print(count)

Solution (Python):
N = int(input()) 
s = [input() for i in range(N)] 
print(len(set(s)))

Solution (Python):
import collections

N = int(input())
S = [input() for i in range(N)]
c = collections.Counter(S)

ans = []
for i in c:
  ans.append(i)
  
print(len(ans))

Solution (Python):
n = int(input())
s=[]
for x in range(n):
    s.append(input())
print(len(set(s)))

Solution (Python):
N = int(input())
d = [input() for i in range(N)]
print(len(set(d)))
print()

Solution (Python):
N = int(input())
S = [str(input().split()) for _ in range(N)]
UniqueS = set(S)
print(len(UniqueS))

Solution (Python):
n=int(input())
s=[0]*n
for i in range(n):
    s[i]=input()
new_s_list=list(set(s))
print(len(new_s_list))

Solution (Python):
N = int(input())
S_tuple =[]
for i in range(N):
	S = str(input())
	S_tuple.append(S)

import collections

S_count= collections.Counter(S_tuple)
print(len(S_count.keys()))

Solution (Python):
n = int(input())
gifts = set([])
for i in range(n):
    gift = input()
    gifts.add(gift)
print(len(gifts))

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

li = []

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

di=dict(li)


print(len(di))

Solution (Python):
n = int(input())
s = dict({})
for i in range(n):
    x = input()
    s[x] = 1
print(len(s.keys()))

Solution (Python):
import collections

n = int(input())

s = []
for _ in range(n):
    s_ = input('')
    s.append(s_)

c = collections.Counter(s)
print(len(c))

Solution (Python):
N = int(input())
dict = {}
for i in range(N):
	dict[input()] = 1
	
print(len(dict))

Solution (Python):
n = int(input())
item = [str(input()) for _ in range(n)]

print(len(set(item)))

Solution (Python):
n = int(input())
sum = 0
l = set()
for _ in range(0,n):
    s = input()
    if s in l:
        continue
    else:
        l.add(s)
        sum += 1

print(sum)

Solution (Python):
from sys import stdin, stdout  
def main(): 
	n = int(stdin.readline().rstrip())
	elements = set()
	for i in range(n):
		elem = stdin.readline().rstrip()
		elements.add(elem)
	stdout.write(str(len(elements)) + '\n')
if __name__ == "__main__": 
	main()

Solution (Python):
import numpy as np
N = int(input())
i = 0

list = []
for i in range(N):
    list.append(input())
    i += 1

unique = np.unique(list)
print(len(unique))

Solution (Python):
n=int(input())
l=[]
for i in range(0,n):
    l.append(input())
print(len(set(l)))

Solution (Python):
import collections
n = int(input())
a =[]
for i in range(0,n):
  j = input()
  a.append(j)

c = collections.Counter(a)
print(len(c))

Solution (Python):
prize = set()

n = int(input())

for i in range(n):
    prize.add(input())

    
print(len(prize))

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

S = []
for i in range(N):
  S.append(input())
  
  
new_S = list(set(S))

print(len(new_S))

Solution (Python):

n=int(input())


s = []

for i in range(n):
    s.append(input())

ans=set(s)
print(len(ans))

Solution (Python):
N = int(input())
s = [input() for i in range(N)]
sets = (list(set(s)))
int_list = []
str_list = []
for set_ in sets:
    try:
        int_list.append(int(set_))
    except ValueError:
        str_list.append(set_)
print(len(str_list))

Solution (Python):
from collections import Counter
S=[]
for i in range(int(input())):
  S.append(input())
d=Counter(S)
print(len(d))

Solution (Python):
import collections
N = int(input())
li = []
for i in range(N):
    S = input()
    li.append(S)
item = collections.Counter(li)
print(len(item))

Solution (Python):
N = int(input())
SN = [input() for _ in range(0, N)]
print(len(set(list(SN))))

Solution (Python):
n=int(input())
s=[]
for i in range(n):
  s.append(input())
  
print(len(set(s)))

Solution (Python):
a=int(input())
l=[]
for _ in range(a):
    l.append(input())
l=set(l)
print(len(l))

Solution (Python):
a = [input() for N in range(int(input()))]

print(len(set(a)))

Solution (Python):
N=int(input())
S = [str(input()) for i in range(N)]
print(len(set(S)))

Solution (Python):
n = int(input())
s = set()
for _ in range(n):
    s.add(input())
print(len(s))

Solution (Python):
import collections
N = int(input())
S = [str(input()) for i in range(N)]
a = collections.Counter(S)
print(len(a))

Solution (Python):
n = int(input())
s = [""]*n
for i in range(n):
  si = str(input())
  s[i] = si
s.sort()
c = 0
s.append("A")
for i in range(n):
  if s[i] != s[i+1]:
    c += 1
print(c)

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

s = []

for i in range(n):
  s.append(input())

s = set(s)

print(len(s))

Solution (Python):

import collections

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

c = collections.Counter(S)
print(len(c))

Solution (Python):



N = int(input())
S = [input() for i in range(1,N+1)]

S_1 = list(set(S))
print(len(S_1))

Solution (Python):
from collections import Counter
n=int(input())
list=[]
for i in range(n):
  list.append(input())
a=Counter(list)
print(len(a))

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

str_set = set([ input() for i in range(n) ])
print(len(str_set))

Solution (Python):
n = int(input())
s = [input() for _ in range(n)]
print(len(set(s)))

Solution (Python):
n=int(input())
dic={}
for i in range(n):
    tmp=input()
    if tmp not in dic.keys():
        dic[tmp]=1
print(len(dic))

Solution (Python):

class abc_164:
    
    def __init__(self):
        pass
    
    def A(self):
        sw=list(map(int,input().split()))
        print("unsafe") if sw[1]>=sw[0] else print("safe")
    
    def B(self):
        abcd=list(map(int,input().split()))
        while(abcd[0]!=0 and abcd[2]!=0):
            abcd[2]=abcd[2]-abcd[1]
            abcd[0]=abcd[0]-abcd[3]
            
            if abcd[2]<=0:
                print("Yes")
                break
            elif abcd[0]<=0:
                print("No")
                break
            else:
                pass
            
    def C(self):
        N=int(input())
        S = [input() for i in range(N)]
        print(len(list(set(S))))
    
    def D(self):
        pass
    
    def E(self):
        pass
    
    def F(self):
        pass
    
    
if __name__=='__main__':
    obj=abc_164()
    obj.C()

Solution (Python):
N = int(input())
import sys
lines = sys.stdin.read().splitlines()

s = set(lines)

lens= len(s)
print (lens)

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

S = set(S)
print(len(S))

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

for i in range(n):
    a[i]=input()
a=sorted(a)
ans=1
for i in range(n-1):
    if a[i]!=a[i+1]:
        ans+=1
print(ans)

Solution (Python):
N = int(input())
kei =[]
for i in range(N):
    s = input()
    kei.append(s)
kei.sort()
t=kei[0]
count=1
for i in range(0,N):
    if(kei[i] != t):
        count+=1
        t = kei[i]
print(count)

Solution (Python):
b=int(input())
l = {input() for _ in range(b)}
print(len(l))

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

s_set = set(s)

print(len(s_set))

Solution (Python):

n = int(input())
lis = []
for i in range(n):
    a=input()
    lis.append(a)
print(len(set(lis)))

Solution (Python):
n = int(input())
l = list()
for i in range(n):
    l.append(input())
print(len(set(l)))

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

print(len(set(l)))

Solution (Python):
N=int(input())
lis=[]
ans=0
for i in range(N):
	lis+=[input()]
print(len(set(lis)))

Solution (Python):
n = int(input())
k =set([input() for _ in range(n)])
print(len(k))

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

print(len(s))

Solution (Python):









def main():
    N = int(input())
    c = set()
    for i in range(0, N):
        c.add(input())
    print(len(c))

if __name__ == "__main__":
    main()

Solution (Python):
a=[]
for i in range(int(input())):
    a.append(input())



s=set(a)
print(len(s))

Solution (Python):
import collections

n = int(input())
result = []
for _ in range(n) :
    thing = input()
    result += [thing]
print(len(collections.Counter(result)))

Solution (Python):

N = int(input())


S_array = []


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


print(len(set(S_array)))

Solution (Python):
N=int(input())
list=[]
new_list=[]
for i in range(0,N):
    item=input()
    list.append(item)
list.sort()
for i in range(0,N):
    if i==N-1:
        new_list.append(list[i])
    elif list[i]==list[i+1]:
        pass
    else:
        new_list.append(list[i])
print(len(new_list))

Solution (Python):
n = int(input())
collections = {}
ans = 0

for _ in range(n):
  s = input()
  collections[s] = 1


print(sum(collections.values()))

Solution (Python):
N = int(input())
S=[]
while N>0:
    s=input()
    S.append(s)
    N=N-1

print(len(set(S)))

Solution (Python):
N = int(input())
ans = set([input() for n in range(N)])
print(len(ans))

Solution (Python):
table = []
n = int(input())
for i in range (n):
    s = input()
    table.append(s)
print(len(list(set(table))))

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

li = []

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

Solution (Python):
N = int(input())
Ss = set()
while N > 0:
    s = input()
    if s not in Ss:
        Ss.add(s)
    N = N -1

print(len(Ss))

Solution (Python):
import collections

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

c = collections.Counter(str_list)
print(len(c))

Solution (Python):
n = int(input())
s = set()
for i in range(n):
  s.add(input())

print(len(s))

Solution (Python):
N = int(input())
lResult = [input() for i in range(N)]

gain = list(set(lResult))

print(len(gain))

Solution (Python):
N=int(input())
S=[input() for n in range(N)]

S.sort()

i=1
prev=S[0]
for e in S:
    if prev!=e:
        i+=1
    prev=e

print(i)

Solution (Python):
n=int(input())
l=[]
for i in range(n):
  l.append(input())
print(len(set(l)))

Solution (Python):
N = int(input())
S = {}
for i in range(N):
  new = input()
  if not(new in S):
    S[new]=1

print(len(S))

Solution (Python):
N = int(input())
S = [input() for _ in range(N)]
print(len(set(S)))

Solution (Python):
import collections
a=int(input())
n=list([input() for i in range(a)])
b=collections.Counter(n)
c,values=zip(*b.most_common())
d=list(values)
print(len(d))

Solution (Python):
n=int(input())
s=[]
ans=[0]*n
for i in range(n):
  s.append(input())

print(len(set(s)))

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

s=list(set(s))
print(len(s))

Solution (Python):
N=int(input())
S=[]
for i in range(N):
  S.append(str(input()))
print(len(set(S)))

Solution (Python):
import collections

N = int(input())
s = [input() for i in range(N)]
h = collections.Counter(s)
print(len(h))

Solution (Python):
def main():
    args = input().rstrip().split(' ')
    N = int(args[0])
    item_list = {}
    for i in range(N):
        item = input().rstrip()
        if(item in item_list):
            item_list[item] += 1
        else:
            item_list[item] = 0
    print(len(item_list))
    
if __name__ == "__main__":
    main()

Solution (Python):
N = int(input())
lst = [input() for _ in range(N)]

print(len(set(lst)))

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

l = list()
for num in range (1,n+1):
    l.append(input())

print(len(set(l)))

Solution (Python):
N = int(input())
S = [input() for i in range(N)]
S_set = set(S)
print(len(S_set))

Solution (Python):
n = int(input())
x = {0}
for i in range(n):
    s = str(input())
    if s in x:
        n -= 1
    else:
        x.add(s)
print(n)

Solution (Python):
N=int(input())
listA=[input() for i in range(N)]
listB=set(listA)
print(len(listB))

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

Solution (Python):
from collections import Counter
N=input()
S=[]
for i in range(int(N)):
  A=input()
  S.append(A)
c = Counter(S)
print(len(c))

Solution (Python):
n=int(input())
ansl=[]
for i in range(n):
  ansl.append(input().rstrip())
print(len(set(ansl)))

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

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


items = set()

for i in range(0, N) :
    items.add(str(input()))
    
    

print(len(items))

Solution (Python):
n = int(input())
ans = len(set([input() for i in range(n)]))
print(ans)

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

Solution (Python):
n=int(input())
s=set()
for _ in range(n):
  s |= {input()}
  
print(len(s))

Solution (Python):
N=int(input())
list=[]
for i in range(N):
    list.append(input())
    
    
import collections
print(len(collections.Counter(list)))

Solution (Python):
N = int(input())
S = [input() for _ in range(N)]
print(len(set(S)))

Solution (Python):
num = int(input())
list1=[]
for i in range(num):
    words = str(input())
    list1.append(words)
setlist= set(list1)
print(len(setlist))

Solution (Python):
N = int(input())
S = []
for _ in range(N):
    S.append(input())
print(len(set(S)))

Solution (Python):
N=int(input())
list=[input() for i in range(N)]
list.sort()
n=1
s=list[0]
for i in range(N):
  if list[i] != s:
    n+=1
    s=list[i]
print(n)

Solution (Python):
A = int(input())
S = [input() for i in range(A)]
print(len(set(S)))

Solution (Python):
a = int(input())
b = []
for i in range(a):
    b.append(input())
print(len(set(b)))

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

for i in range(n):
    A.add(str(input()))

print(len(A))

Solution (Python):
n = int(input())
my_drew = set()
while n:
  n-=1
  my_drew.add(input())
print(len(my_drew))

Solution (Python):
n = int(input())
s = []
for i in range(n):
  s.append(input())
s_unique = list(set(s))
print(len(s_unique))

Solution (Python):
import collections

n = int(input())
li = [input() for i in range(n)]

cnt = collections.Counter(li)
print(len(cnt))

Solution (Python):
n = int(input())
s = []
for i in range(n):
    s.append(input())
print(len(set(s)))

Solution (Python):
def q3():
    N = int(input())
    S = []
    for i in range(N):
        S.append(input())
    print(len(set(S)))


if __name__ == '__main__':
    q3()

Solution (Python):
import collections
a = int(input())
get = [input() for _ in range(a)]
b = list(get)
c = collections.Counter(b)
print(len(c))

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

l=set(l)
print(len(l))

Solution (Python):
l = []
for _ in range(int(input())):
    cad = input()
    l.append(cad)
print(len(set(l)))

Solution (Python):
def resolve():
    n=int(input())
    s = [input() for _ in range(n)]
    print(len(set(s)))
resolve()

Solution (Python):
N = int(input())
S = []
for i in range(N):
    s = input()
    S.append(s)
print(len(set(S)))

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

l = set()

for i in range(N):
	l.add(input());

print(len(l))

Solution (Python):
lotteryCount = int(input())
stringArray = list()
for index in range(0, lotteryCount):
  stringArray.append(input())

variatyCount = len(set(stringArray))
print(variatyCount)

Solution (Python):
import collections

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

ans = collections.Counter(s)
print(len(ans))

Solution (Python):
n = int(input())
s = [input() for _ in range(n)]
print(len(set(s)))

Solution (Python):
count = int(input())
data= []
for i in range(count):
    data.append(input())

d = set(data)
print(len(d))

Solution (Python):
import collections

N = int(input())
S = []
for i in range(N):
    s_pre = str(input())
    S.append(s_pre)

s = collections.Counter(S)

print(len(s))

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

Solution (Python):
N = int(input()) 
s = [input() for i in range(N)] 
print(len(set(s)))

Solution (Python):
n = int(input())
print(len(set([input() for i in range(n)])))

Solution (Python):
N = int(input())
gifts = [input() for param in range(N)]
print(len(set(gifts)))

Solution (Python):
Row = int(input())
List = [input() for i in range(Row)]
print(len((set(List))))

Solution (Python):
import collections
N = int(input())
S = [input() for _ in range(N)]
print(len(collections.Counter(S)))

Solution (Python):
n = int(input())
a = set()
for i in range (1, n+1):
  a.add(input())
print(len(a))

Solution (Python):
from collections import deque
N = int(input())
D = deque()
for _ in range(N):
    D.append(input())
print(len(set(D)))

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


dic = {}
for i in range(N):
    if (S[i] in dic.keys())==False:
        dic[S[i]] = 1

print(len(dic))

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

r=[]
for i in range(N):
    r.append(input())
rr=set(r)
print(len(rr))

Solution (Python):
n = int(input())
set_ = set()
for i in range(n):
    set_.add(input())
print(len(set_))

Solution (Python):
N=int(input())
a=[]
for i in range(N):
  s = input()
  a.append(s)
kind = set(a)
print(len(kind))

Solution (Python):
n = int(input())
lis = []

for i in range(n):
    lis.append(input())

print(len(set(lis)))

Solution (Python):
n = int(input())
S = []
for _ in range(n):
    S.append(input())
SS = set(S)
print(len(SS))

Solution (Python):
a=int(input())
b=[str(input()) for _ in range(a)]
print(len(set(b)))

Solution (Python):
import numpy as np
import itertools
 
if __name__ == "__main__":
    N = int(input())
    A = []
    for i in range(N):
        A.append(input())
    ret = len(set(A))
    print(ret)

Solution (Python):
n=int(input())
string_list=[input() for i in range(n)]
print(len(set(string_list)))

Solution (Python):
N=int(input())
S=[]
for i in range(N):
  S.append(input())
new_S = set(S)
print(len(new_S))

Solution (Python):
N = int(input())
S = [input() for i in range(N)]
print(len(set(S)))

Solution (Python):
n=int(input())
a=[]
for ii in range(n):
	s=input()
	a.append(s)



print(len(list(set(a))))

Solution (Python):
N = int(input())
S = []
for i in range(N):
    S_i = str(input())
    S.append(S_i)

print(len(set(S)))

Solution (Python):
n = int(input())
l = []
for i in range(n):
  p = input()
  l.append(p)
l = set(l)
print(len(l))

Solution (Python):
lst = []

n = int(input())

for i in range(0, n):
    ele = input()
    lst.append(ele)
mylist = list(dict.fromkeys(lst))
print(len(mylist))

Solution (Python):


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

print(len(set(list1)))

Solution (Python):
import os

def main():
	n = int(input())
	syo_list = []
	for i in range(n):
		syo = input()
		syo_list.append(syo)
	print(len(set(syo_list)))

if __name__  == "__main__":
	main()

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

S = [input() for i in range(N)]
S_set = set(S)

print(len(S_set))

Solution (Python):
n=int(input())
list=[input() for i in range(n)]
print(len(set(list)))

Solution (Python):
N = int(input())
S = [input() for _ in range(N)]
uniqued = list(set(S))
print(len(uniqued))

Solution (Python):
N = int(input())
L = set({})
for i in range(N):
    L.add(input())
print(len(L))

Solution (Python):
n = int(input())
s = set([input() for _ in range(n)])
print(len(s))

Solution (Python):
N=int(input())
S=[]
count=1
for i in range(N):
 S.append(input())
S.sort()
for i in range(N-1):
 if S[i]!=S[i+1]:
  count += 1
print(count)

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

a = []
for i in range(n):
    s = input()
    a.append(s)
ans = set(a)
print(len(ans))

Solution (Python):


N = int(input())

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

print( len(set(S)) )

Solution (Python):
n=int(input())
s={}
ct=0
for i in range(n):
  k=input()
  if k not in s: ct+=1
  s[k]=True
print(ct)

Solution (Python):
kuziNum=int(input())
nyuuryokuNum=0
prizeDictionary={}

while kuziNum > nyuuryokuNum:
  nextPrize =input()
  if nextPrize not in prizeDictionary :
    prizeDictionary[nextPrize]=nextPrize
  nyuuryokuNum+=1

print(str(len(prizeDictionary.keys())))

Solution (Python):
n=int(input())
li=[]
num=0
for i in range(n):
    li.append(input())
se=set(li)
lis=list(se)
print(len(lis))

Solution (Python):
N = int(input())
S = []
for n in range(N):
    S.append(input())
S2 = set(S)
print(len(S2))

Solution (Python):
t = int(input())
li = []
for _ in range(t):
  i = input()
  li.append(i)
ans = set(li)
print(len(ans))

Solution (Python):
import collections

N = int(input())
S = [input() for i in range(N)]
l = list(collections.Counter(S))
print(len(l))

Solution (Python):

def main():
    n = int(input())
    string_list = [input() for i in range(n)]
    string_set = set(string_list)
    print(len(string_set))


if __name__ == "__main__":
    main()

Solution (Python):
N = int(input())
S = [input() for n in range(N)]

print(len(set(S)))

Solution (Python):
N = int(input())
S =[]
for i in range(N):
    S.append(str(input()))
SS = set(S)
print(len(SS))

Solution (Python):
n = int(input())
s = [str(input()) for i in range(n)]
ans = len(set(s))
print(ans)

Solution (Python):
N = int(input())
A=[]
 
for i in range(N):
    S=input()
    A.append(S)
 
print(len(list(set(A))))

Solution (Python):
n = int(input());
list_ = [];

for i in range(n):
  list_.append(input());
  
ans = len(list(set(list_)));

print(ans)

Solution (Python):
n = int(input())
l = []
for i in range(n):
  l.append(input())
l.sort()
avant = ""
compte =0
for i in range(n):
  if l[i]!=avant:
    compte+=1
    avant=l[i]
print(compte)

Solution (Python):
N = int(input())
l = [input() for i in range(N)]
set = list(set(l))
print(len(set))

Solution (Python):
input_count = int(input())
goods_list = []

for i in range(input_count):
    input_goods = input()
    goods_list.append(input_goods)

print(len(set(goods_list)))

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

pre_list = []
for i in range(str):
    temp = input().split()
    pre_list.append(temp[0])

ans = list(set(pre_list))
print(len(ans))

Solution (Python):
list=[]

N=input()
for i in range(int(N)):
  s=input();
  list.append(s)
kind=len(set(list))
print(kind)

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

Solution (Python):
n=int(input())
s = []
for _ in range(n):
    s.append(input())
sl=set(s)
print(len(sl))

Solution (Python):
N = int(input())
arr = [input() for i in range(N)]

print(len(list(set(arr))))

Solution (Python):
l = set()
for _ in range(int(input())):
    l.add(input())
print(len(l))

Solution (Python):
S  = {}

N = (int)(input())

for i in range(N):
  s = input()
  if s not in S:
    S[s] = 1
    
print(len(S))

Solution (Python):
N = int(input())
S = [input() for _ in range(N)]  
S.sort()
uni_count = 1
for i in range(N-1):
    if(S[i+1]!=S[i]):
        uni_count += 1
print(uni_count)

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

x = set()

for i in range(n):
  x.add(input())
  
print(len(x))

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

s = set()
for i in range(N):
    s.add(input())

print(len(s))

Solution (Python):
import collections

N=int(input())
A=[input() for i in range(N)]

print(len(set(A)))

Solution (Python):
import collections

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

c = collections.Counter(s)
print(len(c))

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

Answer = set(S)
print(len(list(Answer)))

Solution (Python):
N = int(input())
print(len({input() for _ in range(N)}))

Solution (Python):
"""write your code in method solve"""
def solve():
   
    number=int(input())
    items=[]
    for i in range(number):
        item=input()
        items.append(item)
    a=set(items)
    print(len(a))

    return
solve()

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

Solution (Python):
N = int(input())
A = set([])
count = 0
for _ in range(N):
  item = input()
  if (item in A) == False:
    count = count + 1
    A.add(item)
print(count)

Solution (Python):
n = int(input())
s = {input() for i in range(n)}
print(len(s))

Solution (Python):
N = int(input())
L = [str(input()) for i in range(N)]
L_removed = set(L)
print(len(L_removed))

Solution (Python):
n = int(input())
List = [[] for i in range(10)]
for i in range(n):
    s = input()
    List[len(s) - 1].append(s)

count = 0
for each_list in List:
    each_list = list(set(each_list))
    count += (len(each_list))



print(count)

Solution (Python):


import sys
import math


debug = False

def log(text):
    if debug:
        print(text)


def parse_input(lines_as_string = None):

    global debug
    lines = []
    if lines_as_string is None:
        debug = False
        lines.append(input())
        n = int(lines[0])
        for _ in range(n):
            lines.append(input())
    else:
        debug = True
        lines = [e for e in lines_as_string.split("\n")][1:-1]
        n = int(lines[0])
    
    s = lines[1:]

    return (n, s)


def solve(n, s):

    result = len(set(s))

    return  result


def main():
    
    result = solve(*parse_input())
    if isinstance(result, list):
        for r in result:
            print("%s" % r, sep='')
    else:
        print("%s" % result, sep='')

if __name__ == '__main__':

    main()

Solution (Python):
from collections import defaultdict

n = int(input())
s=[0]*n
d={}

for i in range(n):
    s[i]=str(input().split())
    if s[i] in d.keys():
        d[s[i]]+=1
    else:
        d[s[i]]=1

print(len(d))

Solution (Python):
n = int(input())
list = {}
for x in range(n):
	item = input()
	list[item] = x
print(len(list))

Solution (Python):
lines = []
i =int(input())
for a in range(i):
    line = input()
    lines.append(line)

print(len(set(lines)))

Solution (Python):
n = int(input())
s = set()
for i in range(0, n):
    s.add(input())
print(len(s))

Solution (Python):
s=set()
for i in range(int(input())):
    a=input()
    s.add(a)
print(len(s))

Solution (Python):
N=int(input())
item=[]
for i in range(N):
    item.append(input())
print(len(set(item)))

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

ans = len(set(s))

print(ans)

Solution (Python):
N = int(input())
S = [0] * N
correct = "null"
check = 0
for i in range(N):
    S[i] = input()
S.sort()
for thing in S:
    if(thing != correct):
        check += 1
    correct = thing
print(check)

Solution (Python):
import collections

n = int(input())  
str_list = []
for i in range(n):
    str_list.append(input())
c = collections.Counter(str_list)
print(len(c))

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

s = set(S)


print(len(s))

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

m=set(string_list)

print(len(m))