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):
def solve():
    from sys import stdin
    lines = stdin
    
    N = int(lines.readline())
    
    giveaway = set(lines.readlines())
    
    print(len(giveaway))

solve()

Solution (Python):
from sys import stdin
N = int(stdin.readline().rstrip())
S = [stdin.readline().rstrip() for _ in range(N)]
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):
import sys
n = int(input().strip())
items = set()
for _ in range(n):
  items |= {sys.stdin.readline().strip()}
print(len(items))

Solution (Python):
def resolve():

    n = int(input())
    gacha_list=[input() for i in range(n)]
    gacha_prize=list(set(gacha_list))
    print(len(gacha_prize))
    
resolve()

Solution (Python):
from pip._vendor.distlib.compat import raw_input

n = int(raw_input())
items = set()
for i in range(n):
    items.add(raw_input())
print(len(items))

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

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

set_S = set(S)
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())

all = {input() for _ in range(n)}

print(len(all))

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

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

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

print(len(set(s_list)))

Solution (Python):
import sys

items = []

for _ in range(int(sys.stdin.readline())):
    si = sys.stdin.readline().split()[0]
    items.append(si)


print(len(set(items)))

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

Solution (Python):
items = []

for i in range(int(input())):
    items.append(input())
set = set(items)
print(len(set))

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

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

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

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

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

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

Solution (Python):
N = int(input())
S = set()
i = 1
while i <= N:
   S.add(input())
   i += 1
print(len(S))

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

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

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

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

Solution (Python):
l = {}
N = int(input().rstrip())
for i in range(N):
    k = input().rstrip()
    l[k] = 0
    

print(len(l))

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

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

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

Solution (Python):
N = int(input())
list1 = set()
for i in range(N):
    taisho = input()
    if not taisho in list1:
        list1.add(taisho)
print(len(list1))

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

print(len(set(s)))

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

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

Solution (Python):
N = int(input())
all_prize = {}
for i in range(N):
    prize = input()
    if prize in all_prize.keys():
        all_prize[prize] += 1
    else:
        all_prize[prize] = 1

print(len(all_prize))

Solution (Python):

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


if __name__ == "__main__":
    main()

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

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

Solution (Python):
N = int(input())
S = {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())
L=[input() for i in  range(N)]
M=set(L)
print(len(M))

Solution (Python):
from sys import stdin

n = int(stdin.readline().rstrip())
s = [x.replace("\n", "") for x in stdin.readlines()]
sg = set(s[:n])
print(len(sg))

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

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

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

slist_u = list(set(slist))

slist_u_len = len(slist_u)
print(slist_u_len)

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

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

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

strlist = set()
for i in range(count):
  strlist.add(input())

print(len(strlist))

Solution (Python):
d = {}
N = int(input())
for i in range(N):
  k = input()
  if k not in d:
    d[k] = 1
  else:
    d[k]+=1
print(len(d))

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

Solution (Python):
import collections

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


if __name__ == '__main__':
    main()

Solution (Python):

l = input().split()
a = int(l[0])

setL = set()
while a > 0:
    setL.add(input())
    a-=1
print(len(setL))

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

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

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

str1 = [str(input()) for i in range(N)]


new_str1 = sorted(str1)



count=0
for i in range( N-1 ) :
    if new_str1[i] != new_str1[i+1] :
        count=count+1

print(count+1)

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


print(len(set(string_list)))

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

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

Solution (Python):
import sys

sys.setrecursionlimit(10**7)
readline = sys.stdin.readline

ns = lambda: readline().rstrip()
ni = lambda: int(readline().rstrip())
nm = lambda: map(int, readline().split())
nl = lambda: list(map(int, readline().split()))

n = ni()
l = [input() for _ in range(n)]
print(len(set(l)))

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

if __name__ == '__main__':
    main()

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

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

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

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

Solution (Python):
n=int(input())
items={1}
for i in range(0,n):
  items.add(input())
print(len(items)-1)

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

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

print(len(set(ar)))

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

ans = len(set(input() for i in range(n)))

print(ans)

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

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

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

print(len(set(string_list)))

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

Solution (Python):


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

s = set(A)
print(len(s))

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

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

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

print(len(set(s)))

Solution (Python):
n = int(input())
item = {}
for i in range(n):
  it = input()
  item[it] = 'y'
print(len(item))

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())
l=[]
while n > 0:
  a=str(input())
  l.append(a)
  n-=1
l=set(l)
print(len(l))

Solution (Python):


inputs = input()
N =int(inputs)

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

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

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

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

Solution (Python):
l = []

a = int(input())

cnt = 0
while cnt < a:
    data = input()
    l.append(data)
    cnt = cnt + 1



print(len(set(l)))

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

s={str(input()) for i in range(n)}
print(len(s))

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

Solution (Python):
import collections


draw_count = int(input())


item = [input() for i in range(draw_count)]


item_type = collections.Counter(item)


print(len(item_type))

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

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

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

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

d = {}
for _ in range(N):
  s = input()
  d[s]=0
  
print(len(d))

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

Solution (Python):
def solve(n, s):
    return len(set(s))

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

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

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

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

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

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

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

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

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):
n = int(input())

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

s_u = set(s)
print(len(s_u))

Solution (Python):


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

print(len(S))

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

Solution (Python):
import collections

num = int(input())
S = [str(input()) for _ in range(num)]

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

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


dic={}
for i in ilist:
  dic[i]=1

print (len(dic))

Solution (Python):

num = int(input())
lst = []
for i in range(num):
    lst.append(input())
print(len(set(lst)))

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

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

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

ans = len(set(str))

print(ans)

Solution (Python):
from collections import defaultdict
d = defaultdict(int)
n = int(input())
i = 0
while i < n:
    s = input()
    d[s] += 1
    i += 1
print(len(d))

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

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

Solution (Python):
import collections

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

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

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

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

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

print(len(s))

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

while(n>0):
    n-=1
    str=input()

    dict[str]=1

print(len(dict))

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())
S = set()
for _ in range(N):
    S.add(input())

print(len(S))

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

Solution (Python):
n = input()
gift = set()

for num in range(int(n)):
    gift.add(input())

print(len(gift))

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

print(len(Set))

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

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

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

all_S = set()

for i in range(N):
    all_S.add(str(input()))

print(len(all_S))

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

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

print(len(set(s_list)))

Solution (Python):



def main():
    N = int(input())
    S = [None] * N
    for i in range(N):
        S[i] = input()
    
    S = sorted(S)

    ans = 1
    for i in range(1, N):
        if S[i] != S[i-1]:
            ans += 1
    
    return ans


print(main())

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

print(len(set(b)))

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

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

print(len(s))

Solution (Python):
lotteries = []
num_of_lot = 0
num = int(input())

for i in range(num):
    lotteries.append(input())

num_of_lot = len(set(lotteries))
print(num_of_lot)

Solution (Python):
N = int(input())
str_list = sorted(list(input() for _ in range(N)))
str_set = list(set(str_list))
l = len(str_set)
print(l)

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

strList = []
for i in range(loopCnt):
    inputStr = input()
    strList.append(inputStr)

setList = set(strList)

print(str(len(setList)))

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

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

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







item_set = (set(item_list))
print(len(item_set))

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

Solution (Python):
N=int(input())
s=[list(input().split()) for _ in range(N)]
s.sort()
ct=1

for i in range(N-1):
    if s[i]!=s[i+1]:
        ct+=1

print(ct)

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

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

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

Solution (Python):


import sys



















def main():
    mod = 1000000007                  
    inf = float('inf')
    sys.setrecursionlimit(10**6)    
    def input(): return sys.stdin.readline().rstrip()
    def ii():  return int(input())
    def mi():  return map(int, input().split())
    def mi_0(): return map(lambda x: int(x)-1, input().split())
    def lmi(): return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():  return list(input())
    
    
    n = ii()
    L = list(set([input() for _ in range(n)]))
    print(len(L))

if __name__ == "__main__":
    main()

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

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

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

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

Solution (Python):
import sys
import math

lines = sys.stdin.readlines()
N = int(lines[0])
X = []

for i in range(N):
  Si = str(lines[i+1].split('\n')[0])
  X.append(Si)

X.sort()

z = 1
for i in range(N-1):
  if X[i] != X[i+1]:
    z +=1
print(z)

Solution (Python):
import sys
fruits = set()
for i, line in enumerate(sys.stdin):
    if i != 0:
        fruits.add(line)

print(len(fruits))

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

cnt = {}
for Si in S:
    cnt.setdefault(Si, 0)
    cnt[Si] += 1

print(len(cnt.keys()))

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

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

print(len(S))

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


if __name__ == "__main__":
    main()

Solution (Python):
import sys

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

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

for _ in range(N):
    S = input()
    s.add(S)

print(len(s))

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

print(len(set(s)))

Solution (Python):
import sys
sys.setrecursionlimit(10 ** 9)
input = sys.stdin.readline
from itertools import permutations,  combinations, accumulate
from functools import *
from collections import deque, defaultdict, Counter
from heapq import heapify, heappop, heappush, heappushpop

INF = float('inf')
NIL = - 1


N = int(input())
keihin = [input().rstrip() for _ in range(N)]

counter = Counter(keihin)
print(len(counter))

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



Syouhinlist = set(Syouhinlist)
print(len(Syouhinlist))

Solution (Python):
t = int(input())
ans = []
while t:
  s = input()
  ans.append(s)
  t = t - 1
ans = set(ans)
print(len(ans))

Solution (Python):
n = int(input())
ans = 0
arr = []

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

arr = set(arr)

print(len(arr))

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

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

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

print(len(s))

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

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

Solution (Python):
import collections

N = int(input())
S = [input() for _ in range(N)] 
C = collections.Counter(S) 

print(len(C))

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

goods = {}
for i in range(N):
  name = input().rstrip()
  if name in goods.keys():
    goods[name] += 1
  else:
    goods[name] = 1
print(len(goods.keys()))

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

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

print(len(set(S)),end='\n')

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

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

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

Solution (Python):
import collections

n = int(input())
s = [str(input()) for _ in range(n)]
c = collections.Counter(s)
print(len(c.values()))

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

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

Solution (Python):
n = int(input())
a = []
for i in range(0,n):
    a.append(input())
a.sort()
count = 1
for i in range(1,len(a)):
    if a[i] != a[i-1]:
        count = count + 1
print(count)

Solution (Python):


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


print(len(set(s)))

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

print(len(kind))

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

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

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

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

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

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

Solution (Python):
n = int(input())
source = []
for x in range(n):
  source.append(input())
itemset = set()
items = 0
for x in range(n):
  if source[x] not in itemset:
    items += 1
    itemset.add(source[x])
print(items)

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

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

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

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

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

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

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

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

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

Solution (Python):
import collections

N = int(input())
S = [input() for _ in range(N)]
count = collections.Counter(S)

print(len(count))

Solution (Python):
import collections

N =int(input())

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

Solution (Python):
N = int(input())
S = set()
count = 0
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())
L = set([input() for _ in range(N)])
print(len(L))

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

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

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

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

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

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

K2 = set(K)

print("{}".format(len(K2)))

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

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

main4()

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


print(len(set(S)))

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

set_ = []
for i in range(num):
  a = input()
  set_.append(a)
  
print(len(set(set_)))

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

Solution (Python):
from sys import stdin, stdout
from collections import defaultdict
import math
from queue import Queue

d = defaultdict(int)

n = int(stdin.readline().strip())

for _ in range(n):
    d[stdin.readline().strip()] += 1

stdout.writelines(str(len(d))+'\n')

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

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

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

print(len(set(sequence)))

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

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

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

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

Solution (Python):
n=int(input())
p=set((input() for x in [0]*n))
print(len(p))

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

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

Solution (Python):
n = int(input())
my_set = set([]) 

for _ in range(0, n): 
  my_set.add(str(input()))
 
print(len(my_set))

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

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

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

Solution (Python):


def main():
    
    N = int(input())
    item_set = set()
    for i in range(N):
        item_set.add(input())

    print(len(item_set))


main()

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

Solution (Python):
import numpy as np

n = int(input().strip())
ss = []
for _ in range(n):
      ss.append(input().strip())

ss = np.array(ss)
print(len(np.unique(ss)))

Solution (Python):

N = int(input())
Si = []
for k in range(N):
    Si.append(input())

Si = set(Si)
print(len(Si))

Solution (Python):



import sys
input = sys.stdin.readline

N = int(input())
A = [input().rstrip() for _ in range(N)]
ans = len(set(A))
print(ans)

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

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

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

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([input() for i in range(n)])
print(len(s))

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

Solution (Python):
n = int(input())
"""
N個の連続する文字列の標準入力
"""
s = [input() for i in range(n)]
"""
set(l) lに含まれるユニークな文字列を抽出
"""
print(len(set(s)))

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

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

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

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

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

print(len(S))

Solution (Python):
t = int(input())
s = [input() for i in range(t)]
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())
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 collections
n = int(input())
s = [input() for i in range(n)]

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

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

Solution (Python):
n=int(input())
s=set()
for _  in range(n): 
  s.add(input())
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())

A = set()

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

print(len(A))

Solution (Python):
from collections import Counter

N, *S = open(0)

C = Counter(S)
print(len(C.keys()))

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

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

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

Solution (Python):


def read_int():
    return int(input().strip())


def read_ints():
    return list(map(int, input().strip().split(' ')))


def solve():
    N = read_int()
    items = set()
    for _ in range(N):
        items.add(input().strip())
    return len(items)


if __name__ == '__main__':
    print(solve())

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

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

print(len(items))