Problem:


Score : 300 points

Problem Statement

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

How many kinds of items did you get?

Constraints

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

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

Input

Input is given from Standard Input in the following format:

N
S_1
:
S_N

Output

Print the number of kinds of items you got.

Sample Input 1

3
apple
orange
apple

Sample Output 1

2

You got two kinds of items: apple and orange.

Sample Input 2

5
grape
grape
grape
grape
grape

Sample Output 2

1

Sample Input 3

4
aaaa
a
aaa
aa

Sample Output 3

4



Sample input:
3
apple
orange
apple


Sample output:
2

Submission status: Accepted

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

print(len(s))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# encoding:utf-8
import copy
import random
import bisect #bisect_left　これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys
import collections
from decimal import Decimal # 10進数で考慮できる

mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000

d = collections.deque()
def LI(): return list(map(int, sys.stdin.readline().split()))


N = int(input())
S = ["" for i in range(N)]
for i in range(N):
    S[i] = str(input())


print(len(set(S)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
A = [None] * N
for i in range(N):
    A[i] = input()

print(len(set(A)))

Submission status: Accepted

Solution code:
import sys 
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N = int(readline())
S = list(read().decode().rstrip().split())
print(len(set(S)))

Submission status: Accepted

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

Submission status: Accepted

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

print(len(s))

Submission status: Accepted

Solution code:
N = int(input())
goods = {}
count = 0
for i in range(N):
  good = input()
  goods[good] =1
    
    
print(len(goods))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
a = [input() for i in range(n)]
a.sort()

con = 1;
for k in range(1,n):
    if a[k-1] != a[k]:
        con += 1;
        
print(con);

Submission status: Accepted

Solution code:
N = int(input())
ans = {}
for S in range(N):
    ans[input()] = 0
print(len(ans))

Submission status: Accepted

Solution code:
def main():

    N = input_int()

    prize = set()

    for _ in range(N):
        prize.add(input())
    
    print(len(prize))


def input_int():
    return int(input())


def input_ints():
    return map(int, input().split())


def input_int_list_in_line():
    return list(map(int, input().split()))


def input_int_tuple_list(n: int, q: int):
    return [tuple(map(int, input().split())) for _ in range(n)]


main()

Submission status: Accepted

Solution code:
import sys

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

N = int(readline())
print(len(set(read().split())))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
nii=lambda:map(int,stdin.readline().split())
lnii=lambda:list(map(int,stdin.readline().split()))

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n = int(input())

ans = set()

for i in range(n):
    ans |= set(map(str,input().split()))

print(len(ans))

Submission status: Accepted

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

Submission status: Accepted

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

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

print(len(S))

Submission status: Accepted

Solution code:
N = int(input())

result = []

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

print(len(set(result)))

Submission status: Accepted

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

st = set(s)

print(len(st))

Submission status: Accepted

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

Submission status: Accepted

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

# for _ の"_"はこの変数を使いませんよ、という意味.
for _ in range(n):
    s = input()
    #appendで追加.
    list.append(s)
new_list = sorted(list)
ans = n
for i in range(n - 1):
    if new_list[i] == new_list[i + 1]:
        #ans--はpythonで不可能.
        ans -= 1
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
string_set = set()
for i in range(n):
    string_set.add(input())

print(len(string_set))

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
A = int(input())
S = []
for i in range(0,A):
  S.append(str(input()))
print(len(set(S)))

Submission status: Accepted

Solution code:
import sys
from collections import deque
import numpy as np
import math
sys.setrecursionlimit(10**6)
def S(): return sys.stdin.readline().rstrip()
def SL(): return map(str,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def IL(): return map(int,sys.stdin.readline().rstrip().split())

def Main():
    n = I()
    p = set()
    for _ in range(n):
        p.add(S())
    print(len(p))
    return

if __name__=='__main__':
    Main()

Submission status: Accepted

Solution code:
def resolve():
	N = int(input())
	s = set()
	for i in range(N):
		s.add(input())
	print(len(s))

resolve()

Submission status: Accepted

Solution code:
def main():
    n=int(input())
    s = set(input() for _ in range(n))
    print(len(s))
    
if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
items = {}

for i in range(n):
    item = input()
    items[item] = True

print(len(items))

Submission status: Accepted

Solution code:
N = int(input())
S = []
for n in range(N):
    Sn = str(input())
    S.append(Sn)
ans = len(list(dict.fromkeys(S)))
print(ans)

Submission status: Accepted

Solution code:
def gacha():
    N = int(input())
    S = []
    for i in range(0, N):
        S.append(input())
    
    S = list(set(S))
    print(len(S))
    return

gacha()

Submission status: Accepted

Solution code:
n,*s=open(0).read().split();print(len(set(s)))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
lst = {}
for i in range(N):
    S = str(input())
    if S not in lst.keys():
        lst[S] = []

print(len(lst))

Submission status: Accepted

Solution code:
import sys
def main():
    N=int(sys.stdin.readline())
    a=[sys.stdin.readline().strip() for _ in range(N)]
    s=set(a)
    print(len(s))
if __name__=='__main__':main()

Submission status: Accepted

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

Submission status: Accepted

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

for i in range(n):
    s.add(input())
#print("{}".format(s))

ret = s.__len__()
print("{}".format(ret))

Submission status: Accepted

Solution code:
N = int(input())
S = {input().rstrip('\n') for i in range(N)}

# print(S)
print(len(S))

Submission status: Accepted

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

print(len(set(S)))

Submission status: Accepted

Solution code:
#164
N = int(input())
kinds = {input() for i in range(N)}
print(len(kinds))

Submission status: Accepted

Solution code:
n = int(input())
s = ["a"]*n
for i in range(n):
  s[i] = input()
print(len(list(set(s))))

Submission status: Accepted

Solution code:
import collections
n = int(input())
list=[]
count = 0

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

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

Submission status: Accepted

Solution code:
N=int(input())
A=set(input() for i in range(N))
print(len(A))

Submission status: Accepted

Solution code:
import sys
import collections
input = lambda: sys.stdin.readline().rstrip()

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n = int(input())
gacha_list = []
for i in range(n):
    gacha = str(input())
    gacha_list.append(gacha)
gacha_list = set(gacha_list)
print(len(gacha_list))

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

stdin = sys.stdin

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

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

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

Submission status: Accepted

Solution code:
import sys
from math import sqrt, gcd, ceil, log
from bisect import bisect
from collections import defaultdict
inp = sys.stdin.readline
read = lambda: list(map(int, inp().strip().split()))

# sys.setrecursionlimit(10**6)



def solve():
	sett = set()
	for _ in range(int(inp())):
		sett.add(inp())
	print(len(sett))



if __name__ == "__main__":
	solve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=int(input())

tmp_list=[]
for tmp in range(0,n):
    a=str(input())
    tmp_list.append(a)

tmp_list=set(tmp_list)
print(len(tmp_list))

Submission status: Accepted

Solution code:
#include <CodeforcesSolutions.h>
#include <ONLINE_JUDGE <solution.cf(contestID = "1364",problemID = "A",method = "GET")>.h>
"""
    Author : thekushalghosh
    Team   : CodeDiggers
 
    I prefer Python language over the C++ language :p :D
        
    Visit my website : thekushalghosh.github.io
"""
import sys,math,cmath,time
start_time = time.time()
##########################################################################
################# ---- THE ACTUAL CODE STARTS BELOW ---- #################

def solve():
    n = inp()
    a = []
    for i in range(n):
        s = insr()
        a.append(s)
    print(len(set(a)))
            
################## ---- THE ACTUAL CODE ENDS ABOVE ---- ##################
##########################################################################
 
def main():
    global tt
    if not ONLINE_JUDGE:
        sys.stdin = open("input.txt","r")
        sys.stdout = open("output.txt","w")
    t = 1
    for tt in range(t):
        solve()
    if not ONLINE_JUDGE:
        print("Time Elapsed :",time.time() - start_time,"seconds")
        sys.stdout.close()
    
#---------------------- USER DEFINED INPUT FUNCTIONS ----------------------#
def inp():
    return(int(input()))
def inlt():
    return(list(map(int,input().split())))
def insr():
    return(input().strip())
def invr():
    return(map(int,input().split()))
 
#------------------ USER DEFINED PROGRAMMING FUNCTIONS ------------------#
def counter(a):
    q = [0] * max(a)
    for i in range(len(a)):
        q[a[i] - 1] = q[a[i] - 1] + 1
    return(q)
 
def string_counter(a):
    q = [0] * 26
    for i in range(len(a)):
        q[ord(a[i]) - 97] = q[ord(a[i]) - 97] + 1
    return(q)

def power_two(n):
    if n == 1:
        return(True)
    sttr = str(n)
    len_str = len(sttr)
    sttr = list(sttr)
    num = 0
    if (len_str == 1 and sttr[len_str - 1] == '1'): 
        return(False)
    while (len_str != 1 or sttr[len_str - 1] != '1'):
        if ((ord(sttr[len_str - 1]) - ord('0')) % 2 == 1):
            return(False)
        j = 0; 
        for i in range(len_str):  
            num = num * 10 + (ord(sttr[i]) - ord('0')); 
            if (num < 2): 
                if (i != 0):  
                    sttr[j] = '0'
                    j += 1
                continue
  
            sttr[j] = chr((num // 2) + ord('0'))
            j += 1; 
            num = (num) - (num // 2) * 2
        len_str = j
    return(True)

def getLeftmostBit(n): 
    m = 0
    while (n > 1) : 
        n = n >> 1
        m += 1
    return(m)
def getNextLeftmostBit(n, m) : 
    temp = 1 << m 
    while (n < temp) : 
        temp = temp >> 1
        m -= 1
    return m
def bitcounter(n) :
    m = getLeftmostBit(n) 
    return _countSetBits(n, m) 
def _countSetBits(n, m) :
    if (n == 0) : 
        return 0
    m = getNextLeftmostBit(n, m)
    if (n == (1 << (m + 1)) - 1) : 
        return ((m + 1) * (1 << m))
    n = n - (1 << m)
    return (n + 1) + bitcounter(n) + m * (1 << (m - 1)) 

def log_two(n): 
    return(math.log(n) / math.log(2))

#-----------------------------------------------------------------------#
        
ONLINE_JUDGE = __debug__
if ONLINE_JUDGE:
    input = sys.stdin.readline
    
main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
def fact(n):
    ans = 1
    for i in range(2, n+1):
        ans*= i
    return ans
def comb(n, c):
    return fact(n)//(fact(n-c)*c)

n = int(input())
c = {}
for i in range(n):
    s = str(input())
    if(s in c):
        c[s]+=1
    else:
        c[s] = 0
print(len(c))

Submission status: Accepted

Solution code:
N = int(input())
getlist = set([])

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

print(len(getlist))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

    keihin = set()
    for _ in range(N):
        keihin.add(input())

    print(len(keihin))

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
N = int(input())

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

print(len(set(S)))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
n = int(input())
s = [input() for _ in range(n)]

print(len(set(s)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
from collections import Counter
n, *s = open(0).read().split()
print(len(Counter(s)))

Submission status: Accepted

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

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

Submission status: Accepted

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


if __name__=="__main__":
    main()

Submission status: Accepted

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

print(len(set(S)))

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

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

print(len(set))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

Solution code:
import collections
N=int(input())
l = []
for _ in range(N):
    l.append(input())
c = collections.Counter(l)
print(len(c))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
biki = []
bise = {}
for i in range(N):
    S = input()
    biki.append(S)
bise=set(biki)
print(len(bise))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

Solution code:
n = int(input())

s_list = []

for i in range(n):
    s = str(input())
    s_list.append(s)
s_list = list(set(s_list))
print(len(s_list))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
N, *S = open(0).read().split()
print(len(set(S)))

Submission status: Accepted

Solution code:
# C - gacha
N = int(input())
ans = set()
for _ in range(N):
    S = input()
    ans.add(S)
print(len(ans))

Submission status: Accepted

Solution code:
import collections
n=int(input())
get=[]
for i in range(n):
  s=input()
  get.append(s)
  
c = collections.Counter(get)
print(len(c))

Submission status: Accepted

Solution code:
n = int(input())
s = [0]*n

for i in range(n):
  s[i] = input()
ans = 0
s.sort()
for i in range(n-1):
  if s[i] != s[i+1]:
    ans += 1
    
print(ans+1)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n = int(input())
items = set()
for i in range(n):
    items.add(input())

print(len(items))

Submission status: Accepted

Solution code:
N = int(input())
present = set()
for _ in range(N):
    present.add(input())

print(len(present))

Submission status: Accepted

Solution code:
n = int(input())
L = {}
for i in range(n):
    v = input()
    if v not in L:
      L[v] = ''
print(len(L))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

slist.sort()
cnt = 0

for i in range(int(n)):
  if i == 0:
    cnt += 1
    word = slist[i]
  elif word != slist[i]:
    cnt += 1
    word = slist[i]
    
print(cnt)

Submission status: Accepted

Solution code:
N    = int(input())
Item = ['']*N
for T in range(0,N):
    Item[T] = input()
print(len(set(Item)))

Submission status: Accepted

Solution code:
def solve():
    N = int(input())
    prize = set()
    for _ in range(N):
        prize.add(input())
    print(len(prize))



if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
N = int(input())
l = []*N
for i in range(N):
    l.append(str(input()))

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(len(l))

Submission status: Accepted

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

print(len(set(l)))

Submission status: Accepted

Solution code:
N = int(input().rstrip())
items = []
for n in range(N):
  items.append(input().rstrip())
print(len(set(items)))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import collections
n=int(input())
data=[""]*n
for i in range(n):
    data[i]=input()
data=collections.Counter(data)
data=list(data.keys())
print(len(data))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

for i in range(n):
    x=input()
    l.append(x)
    
l2=list(set(l))    
print(len(l2))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
items = set()

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

print(len(items))

Submission status: Accepted

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

print(len(set(kinds)))

Submission status: Accepted

Solution code:
n = int(input())
li = list()
for i in range(n):
	li.append(str(input()))

print(len(set(li)))

Submission status: Accepted

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

for i in range(n):
     ans[i] = s[i]

ANS = set(ans)
print(len(ANS))

Submission status: Accepted

Solution code:
n = int(input())

vary = []

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

uni = list(set(vary))

print(len(uni))

Submission status: Accepted

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

Submission status: Accepted

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

"""

"""

n = int(input())
seen = set()
for _ in range(n):
    seen.add(input().rstrip())
print(len(seen))

Submission status: Accepted

Solution code:
from sys import stdin, stdout
n = int(input())
s = set()
for _ in range(n):
    s.add(input())

print(len(s))

Submission status: Accepted

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

Submission status: Accepted

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

print(len(list(set(c))))

Submission status: Accepted

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

Submission status: Accepted

Solution code:


def main():
    n = int(input())
    prize = set()
    for _ in range(n):
        prize.add(input())
    print(len(prize))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n=int(input())
l=set()
for i in range(n):
    k=input()
    l.add(k)
print(len(l))

Submission status: Accepted

Solution code:
n=int(input())
l=set()
for i in range(n):
    k=input()
    q=k in l
    if q==False:
        l.add(k)
print(len(l))

Submission status: Accepted

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

print(len(set(s)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    n = int(input())
    s = [input() for i in range(n)]
    res = set()
    for i in s:
        res.add(i)
    print(len(res))
if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

print(len(s))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=int(input())
# n個分入力させて
s=[input() for _ in range(n)]
# 多分set型に入れた段階で重複は無視してくれんのかな
print(len(set(s)))

Submission status: Accepted

Solution code:
N = int(input())
prize = {}

for i in range(N):
    s = str(input())
    if s in prize:
        continue
    else:
        prize[s] = 1

print(len(prize))

Submission status: Accepted

Solution code:
L=list()
N=int(input())
for i in range(N):
  L.append(input())
print(len(set(L)))

Submission status: Accepted

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

print(len(set(P)))

Submission status: Accepted

Solution code:
def resolve():
    n = int(input())
    array = []

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

    print(len(set(array)))
resolve()

Submission status: Accepted

Solution code:
import sys
import collections
input = lambda: sys.stdin.readline().rstrip()

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N=int(input())
S=[]
count=0
for i in range(N):
    sample=input()
    S.append(sample)



    
    
print(len(set(S)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

gifts = []

for _ in range(N):
  gifts.append(input())
  
print(len(set(gifts)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
gatcha = {}

for i in range(n):
    string = input()
    if string not in gatcha.keys():
        gatcha[string] = 1
    else:
        gatcha[string] += 1

print(len(gatcha))

Submission status: Accepted

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

s_set = set(s)

print(len(s_set))

Submission status: Accepted

Solution code:
n=int(input())
l = [input() for _ in [0]*n]
print(len(set(l)))

Submission status: Accepted

Solution code:
count = int(input())

getted_list =[]
for i in range(count):
    getted_list.append(input())
print(len(set(getted_list)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
prizes = set()
unique = 0
for _ in range(N):
    curr = input()
    if not prizes or (curr not in prizes):
        unique += 1
        prizes.add(curr)
print(unique)

Submission status: Accepted

Solution code:
N = int(input())
prizes = set()
unique = 0
for _ in range(N):
    curr = input()
    if not prizes:
        unique += 1
        prizes.add(curr)
    if curr not in prizes:
        prizes.add(curr)
        unique += 1
print(unique)

Submission status: Accepted

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

Submission status: Accepted

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

print(len(set(l)))

Submission status: Accepted

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

for i in range(a):
  b.append(input())
  
b_s = list(set(b))
print(len(b_s))

Submission status: Accepted

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

for i in range(N):
    Gift = input()
    Word_list.append(Gift)
Word_list.sort()

Before_Word = ""

for i in range(N):
    if Word_list[i] != Before_Word:
        ans += 1
        Before_Word = Word_list[i]

print(ans)

#
# for i in range(N):
#     Gift = input()
#     CHECK = "Nothing"
#     for i in Word_list:
#         if i == Gift:
#             CHECK = "Exist"
#             break
#     if CHECK == "Nothing":
#         Word_list.append(Gift)
#         ans += 1
# # print(Word_list)
# print(ans)

Submission status: Accepted

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