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):
n=int(input())
ans=set()
for i in range(n):
    ans.add(input())
print(len(ans))

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

Solution (Python):
N = int(input())
memo = {}

for _ in range(N):
    Si = input()
    memo[Si] = None

print(len(memo))

Solution (Python):
n=int(input())
ans=set()
for x in range(n):
    y=input()
    ans.add(y)
print(len(ans))

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

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

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

print(len(set(items)))

Solution (Python):
N = int(input())
itm = {}
for n in range(N):
    itm[input()] = 0
print(len(itm))

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

print(len(set(a)))

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

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

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

Solution (Python):


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

print(len(set(s)))

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

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

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

Solution (Python):
def main():
    t = int(input())
    s = set()
    for _ in range(t):
        inp = input()
        s.add(inp)
    print(len(s))

if __name__ == "__main__":
    main()

Solution (Python):
from sys import stdin
input = stdin.readline

n = int(input())

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

print(len(set(l)))

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

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

ans = 0



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

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

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

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

print(len(S))

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

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

print(len(set(Slist)))

Solution (Python):
N = int(input())
st = set()
for _ in range(N):
  S = input()
  st.add(S)

print(len(st))

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

Solution (Python):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

n = int(readline())
s = read().decode().rstrip().split()
s = set(s)
print(len(s))

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

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

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

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

print(len(s))

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

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

print(len(s))

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

s=[input() for _ in range(n)]
s=set(s)

print(len(s))

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

dic = {}

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

print(len(dic))

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

Solution (Python):
N = int(input())
s = []
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())

print(len(set(S)))

Solution (Python):
N = int(input())
S = [input() for _ in range(N)]
D = {}
for s in S:
    if s not in D:
        D.setdefault(s, 1)
    else:
        D[s] += 1
print(len(D))

Solution (Python):
num_of_kuji = int(input())
prizes = set()
for _ in range(num_of_kuji):
    prizes.add(input())

print(len(prizes))

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

for i in range(n):
    gacha.append(input())
    
print(len(set(gacha)))

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

a = []
for i in range(N):
  a.append(input())
 
b = set(a)

print(len(list(b)))

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

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())
S = [0] * N
for i in range(N):
    S[i] = input()

C = collections.Counter(S)

print(len(C))

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

Solution (Python):
a = {}
ans = 0

n = int(input())
for _ in range(n):
    i = input()
    ans += a.get(i, 1)
    a[i] = 0

print(ans)

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

Solution (Python):

num = int(input())


l = []

for m in range(num):
    st = input()
    l.append(st)


print(len(set(l)))

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

Solution (Python):

n = int(input())
S = list()
for i in range(1,n+1):
    S.append(input())

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

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

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

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

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

keihin = {}
for i in range(N):
    name = input()
    keihin[name] = i

print(len(keihin.keys()))

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

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

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

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

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

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

print(len(S))

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

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

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

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

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

print(len(s))

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

Solution (Python):
import sys
input = sys.stdin.readline

def main():
    N = int(input())
    print(len(set([input().strip() for i in range(N)])))


if __name__ == "__main__":
    main()

Solution (Python):
N = int(input())
values = [input()]
values_dict = {}
for i in range(N-1):
    values.append(input())

for value in values:
	values_dict[value] = values_dict.get(value, 0) + 1

a = values_dict.keys()
print(len(a))

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

print(len(s))

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

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

l= []

for v in range(n):
    s = input()
    l.append(s)
l = set(l)
print(len(l))

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

keihin = set()
for i in range(n):
    keihin.add(input())

print(len(keihin))

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

gacha = []

for i in range(n):
    item = input()
    gacha.append(item)

print(str(len(set(gacha))))

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

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

print(len(set(S)))

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

s = set(input() for _ in range(N))
    
print(len(s))

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

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

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

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

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

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

Solution (Python):
import sys

readline = sys.stdin.readline
readall = sys.stdin.read
ns = lambda: readline().rstrip()
ni = lambda: int(readline().rstrip())
nm = lambda: map(int, readline().split())
nl = lambda: list(map(int, readline().split()))
prl = lambda x: print(*x ,sep='\n')

n = ni()
ans = set()

for _ in range(n):
    s = ns()
    ans.add(s)

print(len(ans))

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

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

s = set(s)

print(len(s))

Solution (Python):
N = int(input())
d = {}
for i in range(1, N + 1):
  d[input()] = 1

print(len(d))

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

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

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

Solution (Python):

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

    prise = []

    for i in range(n):
        prise.append(input())
    print(len(set(prise)))
resolve()

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

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

a=set(a)

print(len(a))

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

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

Solution (Python):
N = int(input())
 
keihin = {}
 
for i in range(N):
  S = input()
  try:
    keihin[S] += 1
  except:
    keihin[S] = 1
 
print(len(keihin))

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

s = set()

for i in range(N):
  s.add(input())
  
print(len(s))

Solution (Python):
from collections import defaultdict

def main():
    n = int(input())
    d = defaultdict(int)
    count = 0
    for i in range(n):
        s = input()
        if d[s] == 0:
            count+=1
            d[s] += 1
        else:
            continue
    print(count)
    
if __name__ == "__main__":
    main()

Solution (Python):
from collections import defaultdict

def main():
    n = int(input())
    d = defaultdict(int)
    count = 0
    for i in range(n):
        s = input()
        if d[s] == 0:
            count+=1
            d[s] += 1
        else:
            continue
    print(count)
    
if __name__ == "__main__":
    main()

Solution (Python):
n = int(input())
dic = {}

for i in range(n):
    name = input()
    if(name in dic):
        dic[name] +=1
    else:
        dic[name] = 1


print(len(dic))

Solution (Python):


import sys
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
N = I()
S = [S() for _ in range(N)]
dict = {}

for s in S:
	dict[s] = 1
print(len(dict))

Solution (Python):


import sys
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
N = I()
S = [S() for _ in range(N)]
dict = {}

for s in S:
	if s not in dict:
		dict[s] = 1
print(len(dict))

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

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

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

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

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

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

print(len(set(S)))

Solution (Python):
n = int(input())
s = set([])
for i in range(n):
    s.add(input())
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 = []
ans = n
for i in range(n):
    s.append(input())
s = sorted(s)
for i in range(1,n):
    if s[i] == s[i-1]:
        ans-=1
print(ans)

Solution (Python):
import sys


def main():
    readline = sys.stdin.readline
    N = int(readline())
    se = set([readline() for _ in range(N)])
    print(len(se))


if __name__ == "__main__":
    main()

Solution (Python):
N = int(input())
S = [ str(input()) for _ in range(N)]
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 = [input() for _ in range(N)]

d = {}

for word in S:
    if word in d:
        d[word] += 1
    else:
        d[word] = 1

print(len(d.keys()))

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

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

set_S = set(S)
list_set_S = list(set_S)
print(len(list_set_S))

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

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

Solution (Python):

n = int(input())
dic = {}
for i in range(n):
    s = input()
    dic[s] = 0
print(len(dic))

Solution (Python):

n = int(input())
dic = {}
for i in range(n):
    s = input()
    dic[s] = 0
print(len(dic))

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

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 i in range(N):
    S.append(input())
s=collections.Counter(S)
s_key=s.keys()
print(len(s_key))

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

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

Solution (Python):
import collections

n = int(input())

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

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

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

print(len(set(S)))

Solution (Python):

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

sL=set(L)

print(len(sL))

Solution (Python):

n = int(input())
str = [input() for i in range(n)]
str.sort()
k = 1
for i in range(n-1):
    if(str[i] != str[i + 1]):
        k += 1




print(k)

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

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)]

ss = sorted(s)
test = ss[0]
count = 1

for i in range(n):
  if test != ss[i]:
    test = ss[i]
    count += 1
    
print(count)

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

print(len(set(a)))

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

Solution (Python):
N = int(input())
ans = {}
for i in range(N):
  t = input()
  if t not in ans:
    ans[t] = 1
print(len(ans.keys()))

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

s = set(S)

print(len(s))

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

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

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

kind = {}
for i in range(N):
    S = input()

    if S not in kind:
        kind[S] = 1

print(len(kind))

Solution (Python):
def main():
    N = int(input())
    s = set(input() for _ in range(N))
    print(len(s))


if __name__ == "__main__":
    main()

Solution (Python):
from sys import stdin, setrecursionlimit


def main():
    input = stdin.buffer.readline
    n = int(input())
    items = set()
    for _ in range(n):
        items.add(input()[:-1])
    print(len(items))


if __name__ == "__main__":
    setrecursionlimit(10000)
    main()

Solution (Python):
n = int(input())
i = 0
s = set()
while i<n:
    s.add(str(input()))
    i+=1


print(len(s))

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

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

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

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

for i in range(N):
  ans.add(input())

print(len(ans))

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

Solution (Python):
N = int(input().strip())
d = {}
for n in range(N):
    S = input()
    if S in d:
        d[S] += 1
    else:
        d[S] = 0
print(len(d))

Solution (Python):
from collections import defaultdict
counter=defaultdict(int)
N=int(input())
for i in range(N):
  k=input()
  counter[k]+=1
c=0
for s,t in counter.items():
  c+=1
print(c)

Solution (Python):
import sys
input = sys.stdin.readline


'''
A=[]
B=[]
for i in range():
    a, b = map(int, input().split())
    A.append(a)
    B.append(b)'''

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

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

print(len(list(set(J))))

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

print(len(list(set(S))))

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

premiums = set()

for n in range(N):
    premiums.add(input())

print(len(premiums))

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

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

Solution (Python):
import sys
def input(): return sys.stdin.readline().rstrip()
from collections import Counter
def main():
    n=int(input())
    S=[input() for _ in range(n)] 
    sc=Counter(S)
    print(len(sc.items()))
if __name__=='__main__':
    main()

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

gift = []
for _ in range(N):
    s = input()
    gift.append(s)

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

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


ans = set()

for p in P:
    ans.add(p)

print(len(list(ans)))

Solution (Python):
import sys
input=lambda: sys.stdin.readline().rstrip()
n=int(input())
S=set()
for _ in range(n):
  S.add(input())
print(len(S))

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

array = set()

for i in range(n):
    s = input()
    array.add(s)
    
print(len(array))

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


st = set()

for i in range(n):
    s = input()
    st.add(s)


print(len(st))

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

s_unique = list(set(s))

print(len(s_unique))

Solution (Python):
import sys
import itertools
import numpy as np

read = sys.stdin.read 
readline = sys.stdin.readline 
readlines = sys.stdin.readlines 


N = int(readline())
S = set(read().split())

print(len(S))

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

Solution (Python):
def solve(string):
    return str(len(set(string.split())) - 1)


if __name__ == '__main__':
    import sys
    print(solve(sys.stdin.read().strip()))

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

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

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

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

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

Solution (Python):



import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

n = I()
x = set()
for _ in range(n):
    x.add(input())
print(len(x))

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

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


if __name__ == "__main__":
    main()

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

Solution (Python):
def main():
    N=int(input())
    S=set(input() for _ in range(N))
    print(len(S))
    return

if __name__=='__main__':
    main()

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

product = set()
for n in range(N):
    product.add(input())

print(len(product))

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

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

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

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

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

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

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

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

print(len(set(S_list)))

Solution (Python):
def main():
    n = int(input())
    ss = [input() for _ in range(n)]
    ans = len(set(ss))
    print(ans)


if __name__ == "__main__":
    main()

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

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

print(len(set(s)))

Solution (Python):



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

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

s_set = set(s_list)
print(len(s_set))

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

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

l = list(set(l))

ans = len(l)

print(ans)

Solution (Python):
N = int(input())
S = []

for _ in range(N):
    S.append(input())

S = set(S)

ans = len(S)

print(ans)

Solution (Python):
import sys
from collections import deque
import copy
def main():
    N = int(input())
    S = []
    for i in range(N):
        s = input()
        S.append(s)
    S.sort()
    count = N
    for i in range(1, len(S)):
        if S[i - 1] == S[i]:
            count -= 1
    print(count)
    

if __name__ == '__main__':
    main()

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

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

Solution (Python):
import sys
import heapq
sys.setrecursionlimit(10**6)
input = lambda: sys.stdin.readline().rstrip()

N = int(input())
temp = set()
for _ in range(N):
    temp.add(input())
print(len(temp))

Solution (Python):
import collections

N = int(input())
S = list(input() for _ in range(N))

setS = set(S)

print(len(setS))

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

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

print(S)

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

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

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

a={0}
for i in range(N):
    b=input()
    a.add(b)
    
print(len(a)-1)

Solution (Python):
N = int(input())
S = []
for i in range(N):
    s = input()
    S.append(s)
ans = len(S)
S.sort()
for i in range(1,N):
    if S[i] == S[i-1]:
        ans -= 1
print(ans)

Solution (Python):
import math
import time
from collections import defaultdict, deque
from sys import stdin, stdout
from bisect import bisect_left, bisect_right
n = int(input())
ans = 0
c = defaultdict(lambda: 0)
for _ in range(n):
    s = input()
    if(s not in c):
        ans += 1
        c[s] += 1
print(ans)

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

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

count_set = set()

for i in range(n):
    count_set.add(s[i])

print(len(count_set))

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

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

Solution (Python):
print(len(set(input() for _ in range(int(input())))))

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

Solution (Python):
n = int(input())
s = {}
for i in range(n):
    si = input()
    if si in s:
        s[si] += 1
    else:
        s[si] = 1
print(len(s))

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

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 = set()
for i in range(N):
    s.add(input())
print(len(s))

Solution (Python):
N = int(input())
r = set()
for i in range(N):
    r |= set([input()])

print(len(r))

Solution (Python):
import collections 
n=int(input())
s_list=list(input() for _ in range(n))
c=collections.Counter(s_list)
print(len(c.keys()))

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

main()

Solution (Python):
N = int(input(""))
M = []
n = 0

for i in range(N):
    p = input("")
    M.append(p)

Mm = list(set(M))

print(len(Mm))

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

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

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

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

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

list0 = []
for i in range(0,N):
    list0.append(input())

print(len(list(set(list0))))

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

Solution (Python):
n = int(input())
s = set()
[s.add(input()) for _ in range(n)]
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 = set()
for i in range(N):
    S.add(input())
print(len(S))

Solution (Python):
import sys
readline = sys.stdin.readline


def main():
    n = int(readline().rstrip())
    sList = [""] * n
    for i in range(n):
        sList[i] = readline().rstrip()
    print(len(set(sList)))


if __name__ == '__main__':
    main()

Solution (Python):
N = int(input())
st = set()
for i in  range(N):
    S = str(input())
    st.add(S)
print(len(st))

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

print(len(st))

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

Solution (Python):


def solve():
    import sys
    N = int(sys.stdin.readline())

    set_ = set()
    for _ in range(N):
        S = sys.stdin.readline().rstrip()
        set_.add(S)

    print(len(set_))


if __name__ == "__main__":
    solve()

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

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

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

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

Solution (Python):
import itertools
import math
import fractions
import functools
n = int(input())
keihin = set()
for i in range(n):
    keihin.add(input())

print(len(keihin))

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

print(len(set(s)))

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

Solution (Python):


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

print(len(got))

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

print(len(set(s)))

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

l = []

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

res = len(set(l))

print(res)

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

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

Solution (Python):
N = int(input())
S = set()
for i in range(N):
    temp = input()
    S.add(temp)
print(len(S))

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

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

Solution (Python):

import numpy as np

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

s = np.array(s)
s = np.unique(s)

print(len(s))

Solution (Python):
def actual(N, s_list):
    return len(set(s_list))

N = int(input())

s_list = []

for _ in range(N):
  s = input()
  s_list.append(s)
    
print(actual(N, s_list))

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

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

Solution (Python):
if __name__ == '__main__':
    from sys import stdin
    
    import math
    import random
    import collections
    input = stdin.readline
    
    N = int(input())
    S = [input() for i in range(N)]

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