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: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

s = set(S)

print(len(s))

Submission status: Runtime Error

Solution code:
N = int(input())

Ws = [s for _ in range(N)]

print(len(set(Ws)))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = int(input())
i = 0
s = list()
while i<n:
    a = str(input())
    k = 0
    j = 0
    while k<i:
        if s[k] == a:
            j = 1
            break
        k+=1
    if j == 0:
        s.append(a)
    i+=1

print(len(s))

Submission status: Runtime Error

Solution code:
N = int(input())
#S = [input() for _ in range(N)]
S = []
for i in range(N):
    s = input()
    dup = False
    for j in range(i):
        if s == S[j]:
            dup = True
            break
    if not dup:
        S.append(s)
print(len(S))

Submission status: Runtime Error

Solution code:
N=int(input())
A_=set(list(map(int,input().split())))
print(len(A_))

Submission status: Runtime Error

Solution code:
import pandas
N=int(input())
A_=list(map(int,input().split()))
ss=pd.Series(A_)
print(len(pd.unique(ss))

Submission status: Runtime Error

Solution code:
3
apple
orange
apple

Submission status: Runtime Error

Solution code:
n = int(input())

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

print(len(set(s)))  # set()被りを除去、ただし順序はバラバラに

Submission status: Runtime Error

Solution code:
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 n:
    s = input()
    if(s in c):
        ans += 1
        c[s] += 1
print(ans)

Submission status: Runtime Error

Solution code:
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 n:
    s=int(input())
    if(s in c):
        ans+=1
        c[s]+=1
print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
def search(list, item):
  low = 0
  high = len(list) - 1
  while(low <= high):
    mid = (low + high) // 2
    guess = list[mid]
    if(guess == item):
      return mid
    if(guess > item):
      high = mid - 1
    else:
      low = mid + 1
  list.insert(low, item)
  print(list)
  return None

n = int(input())
item = []
for i in range(n):
  s = input()
  search(item, s)
print(len(item))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
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))

Submission status: Runtime Error

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

print(len(type(s)))

Submission status: Runtime Error

Solution code:
from collections import Counter
N = int(input())
S = []
while True:
    S.append(input())

print(len(Counter(S)))

Submission status: Runtime Error

Solution code:
N = int(input())
S = []
while True:
    S.append(input())

print(len(Counter(S)))

Submission status: Runtime Error

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

print(lens(glist))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = input()
a = []
for i in range(N):
  f = input()
  a.append(f)
  
a=list(set(a))

print(len(a))

Submission status: Runtime Error

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

prize = [S[1]]
flag = 0
for i in range(N):
    for j in range(len(prize)):
        if(S[i] == prize[j]):
            flag = 1
    if(flag==0):
        prize = prize + [S[i]]
    flag = 0


print(len(prize))

Submission status: Runtime Error

Solution code:
#include <iostream>
#include <set>
#include <string>
using namespace std;
int main(void){
    int N;
    cin >> N;
    std::set<std::string> s;
    
    for(int i=0; i < N; i++){
        std::string a;
        cin >> a;
        s.insert(a);
    }
    
    cout << s.size() << endl;
}

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
row = int(input())
item_list = [input() for i in range(row)]
result_list = []
for j in item_list:
  exist_in_item_list = False
  for k in result_list.len():
    if result_list[k] == item_list[j]:
      exist_in_item_list = True
      break
  if not exist_in_item_list:
    result_list.append(item_list[j])

print(result_list.len())

Submission status: Runtime Error

Solution code:
row = int(input())
item_list = [input() for i in range(row)]
result_list = []
for j in item_list:
  exist_in_item_list = False
  for k in result_list.len():
    if result_list[k] == item_list[j]:
      exist_in_item_list = True
      break
  result_list.append(item_list[j])

print(result_list.len())

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N=int(input())
kuji=[list(map(str,input().split())) for i in range(N)] 
print(len(set(kuji)))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N=int(input())
a=[input() for i in range(N)]
print(collections.Counter(a))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = int(input())
S = [input() for i in range(N)]
S.sort()
c = 1
for i in range(N-1):
  if S[i] == S[i+1]:
    continue
  else: 
    c++
print(c)

Submission status: Runtime Error

Solution code:
N = int(input())
S = [input() for i in range(N)]
S.sort()
c = 1
for i in range(N-1):
  if S[i] == S[i+1]:
    continue
  else c++:
print(c)

Submission status: Runtime Error

Solution code:
N = int(input())
S = [input() for i in range(N)]
S.sort()
c = 1
for i in range(N-1):
  if S[i] == S[i+1]:
  else c++:
print(c)

Submission status: Runtime Error

Solution code:
N = int(input())
S = [input() for i in range(N)]
S.sort()
c = 1
for i in range(N-1):
  if S[i] == S[i+1]
  else c++
print(c)

Submission status: Runtime Error

Solution code:
n,m,q = map(int,input().split())
a = [0 for i in range(q)]
for i in range(q):
    a[i] = list(map(int,input().split()))
for i in range(1,m+1):
    for j in range(i,m+1):
        for k in range(j,m+1):
            for s in range(k,m+1):
                for p in range(s,m+1):
                    for l in range(p,m+1):
                        for e in range(l,m+1):
                            for u in range(e,m+1):
                                for v in range(u,m+1):
                                    b = [1,f,c,k,s,p,l,e,u,v]
                                    nn = 0
                                    for h in range(q):
                                        if b[a[h][1]-1] - b[a[h][0]-1] == a[h][2]:
                                            nn += a[h][3]
                                    ans = max(ans,nn)
print(ans)

Submission status: Runtime Error

Solution code:
N=int(input())
SS=set()
while N=0:
  S=input()
  SS.add(S)
  N=N-1
print(len(SS))

Submission status: Runtime Error

Solution code:
N=int(input())
SS=set()
while N=0:
  S=input()
  SS.add(S)
  N=N-1

Submission status: Runtime Error

Solution code:
n=int(input())
set={}
for n in range(n):
  set.append(input())
print(len(set))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
# coding:utf-8

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

Submission status: Runtime Error

Solution code:
import sys
n = int(input().strip())
items = set()
for _ in range(n):
  items |= {sys.readline().strip()}
print(len(items))

Submission status: Runtime Error

Solution code:
import sys
n = int(input().strip())
items = set()
for _ in range(n):
  items |= {sys.readline().strip()}

Submission status: Runtime Error

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

for i in range(s):
    r = s.random.choice()
    if r not in memo:    
        memo.append(r)    

print(len(memo))

Submission status: Runtime Error

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

l = set(l)
l = list(l)
print(sum(l))

Submission status: Runtime Error

Solution code:
A=map(int,input().split())
list = []
for n in range(A):
	con = str(input())
	if con not in list:
		list.append(con)
	else: pass
print(str(len(list)))

Submission status: Runtime Error

Solution code:
N=int(input())
A=[]
A.append(int(input()))
a=set(A)
print(len(a))

Submission status: Runtime Error

Solution code:
N=int(input())
A=list(map(int,input().split()))
a=set(A)
print(len(a))

Submission status: Runtime Error

Solution code:
N = int(input())
S = []
while True:
    Si = input()
    if Si:
        S.append(Si)
    else:
        break
g = S[: N]
print(g)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

list_get = []
for i in range(list_S):
  if not list_S[i] in list_get:
    list_get.append(list_S[i])

print(len(list_get))

Submission status: Runtime Error

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

list_get = []
for i in range(list_S):
  if not list_S[i] in list_get: list_get.append(list_S[i])

print(len(list_get))

Submission status: Runtime Error

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

list_get = []
for i in list_S:
  if not list_S[i] in list_get: list_get.append(list_S[i])

print(len(list_get))

Submission status: Runtime Error

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

list_get = []
for i in list_S:
  if not list_S[i] in list_get: list_get.append(list_S[i])

print(len(list_get))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
I = input("")
i = I.split(" ")
print(i)

N = int(i[0])
l = []
t = 0

for k in range(N):
    if i[k+1] not in l:
        l.append(i[k+1])
        t = t+1
print(len(l))

Submission status: Runtime Error

Solution code:
N = int(input())
S_list = list(map(str, input().split()))

for i in range(N):
  S_list.remove(S_list[i])
  N -= (N-len(S_list)-1)
  
print(N)

Submission status: Runtime Error

Solution code:
I = input("")
i = I.split("\n")

N = int(i[0])
l = []
t = 0

for k in range(N):
    if i[k+1] not in l:
        l.append(i[k+1])
        t = t+1
print(len(l))

Submission status: Runtime Error

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

print(len(set(s)))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N=int(input())
L=[input() for i range(N)]
M=sorted(L)
print(len(M))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import collections

n = int(input())
ls = []
for i in range(n):
  ls.append(str(input))
print(len(collentions.Counter(ls)))

Submission status: Runtime Error

Solution code:
nstr = input()
n = int(nstr)

array = [input() for i in range(3)]

result = 1
for i in range(len(array)-1):
    if array[i] != array[i+1]:
        result += 1

print(result)

Submission status: Runtime Error

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

for i in range(N):
    for j in range(N):
        if S[i] == S[j]:
            pair += 1

pair=(pair-N)/2
print(pair)

Submission status: Runtime Error

Solution code:
#include<stdio.h>
#include<map>
#include<cstring>
using namespace std;
typedef unsigned long long ull; 

const int M=1586;
const ull base=233,mod=212370440130137957ll;

int n,num;
char s[M];
map<ull,bool> ch_hash;

void hash()
{
	ull ans=0;
	int len=strlen(s);
	for(int i=0;i<len;i++)
		ans=(ans*base%mod+int(s[i]))%mod;
	if(!ch_hash[ans])
	{
		ch_hash[ans]=true;
		num++;
	}
}

int main()
{
	scanf("%d",&n);
	while(n--)
	{
		scanf("%s",s);
		hash();
	}
	printf("%d\n",num);
	return 0;
}

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = int(input())
A = []
cnt = 0
for i in xrange(n):
    m = input()
    if m not in A:
        A.append(m)
        cnt += 1
print(cnt)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

list(set(s))

Submission status: Runtime Error

Solution code:
S=input().split()
N=S[0]
N=int(N)
del S[0]
T=sorted(S)
c=1
for i in range(N-1):
    if T[i]!=T[i+1]:
        c=c+1

print(c)

Submission status: Runtime Error

Solution code:
S=input().split()
N=int(S[0])
del S[0]
T=sorted(S)
c=1
for i in range(N-1):
    if T[i]==T[i+1]:
        c=c
    else:
        c=c+1

print(c)

Submission status: Runtime Error

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

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

print (len(dic))
~

Submission status: Runtime Error

Solution code:
S=input().split()
N=int(S[0])
del S[0]
T=sorted(S)
c=1
for i in range(N-1):
    if T[i]!=T[i+1]:
        c=c+1

print(c)

Submission status: Runtime Error

Solution code:
S=input().split()
N=int(S[0])
del S[0]
T=sorted(S)
c=1
for i in range(N-1):
    if T[i]!=T[i+1]:
        c=c+1

print("c")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = int(input())
set = {}
for i in range(N):
    A = str(input())
    set.add(A)

print(len(set))

Submission status: Runtime Error

Solution code:
n = int(input())

ansl = []
ans = 0

for i in range(n):
  a = input()
  
  if not a in ansl:
    ans += 1
    a.append(ansl)

print(ans)

Submission status: Runtime Error

Solution code:
N = int(input())
items = set()
for i in range(0, N):
  items.add(input())
return len(items)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
S = [str(input()) for i in range(2*10^5)]
#(2*10^5):    
S.pop(0)
if '' in S:
    print(len(set(S))-1)
else:
    print(len(set(S)))

Submission status: Runtime Error

Solution code:
S=[str(input()) for i in range(2*10^5-1)]
S.pop(0)
print(len(set(S)))

Submission status: Runtime Error

Solution code:
S=[str(input()) for i in range(2*10^1-1)]
S.pop(0)
print(len(set(S))

Submission status: Runtime Error

Solution code:
N = int(input())
L = [input()]
 
for _ in range(N-1):
    a = input()
    imin = 0
    imax = len(L)-1
    l = 0
 
    while (imin<imax):
        l = (imin+imax)//2
        if (a==L[l]):
            break
        elif (a>L[l]):
            imin = min(l+1,len(L)-1)
        else:
            imax = max(l-1,0)
    
    if(imax==imin)       
    	if (a>L[imin]):
        	L.insert(imin+1,a)
    	elif (a<L[imin]):
        	L.insert(imin,a)
            
print(len(L))
N = int(input())
L = [input()]

for _ in range(N-1):
    a = input()
    imin = 0
    imax = len(L)-1
    l = 0

    while (imin<imax):
        l = (imin+imax)//2
        if (a==L[l]):
            break
        elif (a>L[l]):
            imin = min(l+1,len(L)-1)
        else:
            imax = max(l-1,0)
    
    if(imax==imin):     
    	if (a>L[imin]):
        	L.insert(imin+1,a)
    	elif (a<L[imin]):
        	L.insert(imin,a)
            
print(len(L))

Submission status: Runtime Error

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

for _ in range(N-1):
    a = input()
    imin = 0
    imax = len(L)-1
    l = 0

    while (imin<imax):
        l = (imin+imax)//2
        if (a==L[l]):
            break
        elif (a>L[l]):
            imin = min(l+1,len(L)-1)
        else:
            imax = max(l-1,0)
    
    if(imax==imin)       
    	if (a>L[imin]):
        	L.insert(imin+1,a)
    	elif (a<L[imin]):
        	L.insert(imin,a)
            
print(len(L))

Submission status: Runtime Error

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

for _ in range(N-1):
    a = input()
    imin = 0
    imax = len(L)-1
    l = 0

    while (imin<imax):
        l = (imin+imax)//2
        if (a==L[l]):
            break
        elif (a>L[l]):
            imin = min(l+1,len(L)-1)
        else:
            imax = max(l-1,0)
        print(imin,imax,L)
    
    l = (imin+imax)//2       
    if (a>L[l]):
        L.insert(l+1,a)
    elif (a<L[l]):
        L.insert(l,a)
            
print(len(L))

Submission status: Runtime Error

Solution code:
num = int(input())

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

Submission status: Runtime Error

Solution code:
a=int(input())
b=list(map(str,a.split()))
def func(b):
    return len(set(b))
print(func(b))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = int(input())
#景品リスト作成
keihin = []

#かぶってなければ箱へ
for i in range(N):
    if keihin.count(input()) == 0:
        keihin.append(input())

#出力
print(len(keihin))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys 
sys.stdin = open('input.txt', 'r')  
sys.stdout = open('output.txt', 'w') 
t=int(input())
s=set()
for i in range(t):
    # n,m=map(int,input().split())
    n=input()
    s.add(n);
print(len(s));

Submission status: Runtime Error

Solution code:
#dt = {} for i in x: dt[i] = dt.get(i,0)+1
#dt = {k:v for k,v in sorted(x.items(), key=lambda i: i[1])}
ipnl = lambda n: [input() for _ in range(n)]
inp = lambda :int(input())
ip = lambda :[int(w) for w in input().split()]
mp = lambda :map(int,input().split())

n = input()
x = ipnl(n)
print(len(set(x)))

Submission status: Runtime Error

Solution code:
#dt = {} for i in x: dt[i] = dt.get(i,0)+1
#dt = {k:v for k,v in sorted(x.items(), key=lambda i: i[1])}
ipnl = lambda n: [input() for _ in range(n)]
inp = lambda :int(input())
ip = lambda :[int(w) for w in input().split()]
mp = lambda :map(int,input().split())

n = input()
x = inpl(n)
print(len(set(x)))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import collections

N = int(input())
S = []

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

c = collections.counter(S)

print(len(c))

Submission status: Runtime Error

Solution code:
n = input()
s = []
 
for i in range(n):
  s.append(input())
 
for i in range(n):
  for j in range(i,n-1):
    if s[j] < s[j+1]:
      temp = s[j]
      s[j] = s[j+1]
      s[j+1] = temp
    
ans = 1
for i in range(n-1):
  if s[i]!=s[i+1]:
    ans+=1

print(ans)

Submission status: Runtime Error

Solution code:
n = input()
s = []
 
for i in range(n):
  s.append(input())
 
for i in range(n):
  for j in range(i,n-1):
    if s[j] < s[j+1]:
      temp = s[j]
      s[j] = s[j+1]
      s[j+1] = temp
    
ans = 1
for i in range(n-1):

Submission status: Runtime Error

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

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

for i in range(n):
  for j in range(i,n-1):
    if s[j] < s[j+1]:
      temp = s[j]
      s[j] = s[j+1]
      s[j+1] = temp
    
ans = 1
for i in range(n-1):
  if s[i] != s[i+1]:
    ans += 1
    
print(ans)

Submission status: Runtime Error

Solution code:
n = input()

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

for i in range(n):
  for j in range(i,n-1):
    if s[j] < s[j+1]:
      temp = s[j]
      s[j] = s[j+1]
      s[j+1] = temp
    
ans = 1
for i in range(n-1):
  if s[i] != s[i+1]:
    ans += 1
    
print(ans)

Submission status: Runtime Error

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

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

for i in range(n):
  for j in range(i,n-1):
    if s[j] < s[j+1]:
      temp = s[j]
      s[j] = s[j+1]
      s[j+1] = temp
    
ans = 1
for i in range(n-1):
  if s[i] != s[i+1]:
    ans += 1
    
print(ans)

Submission status: Runtime Error

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

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

for i in range(n):
  for j in range(i,n-1):
    if s[j] < s[j+1]:
      temp=s[j]
      s[j]=s[j+1]
      s[j+1]=temp
    
ans = 1
for i in range(n-1)
  if s[i]!=s[i+1]:
    ans+=1
    
print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = int(input())
a_list
for i in range(N):
  a_list.append(input())
  
a_ = set(a_list)

a_num = len(a_)

print(a_num)

Submission status: Runtime Error

Solution code:
N = int(input())

a_list = []

for i in range(N):
  a_list.append(list(input()))
  
a_num = len(set(a_list))

print(a_num)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import collections
n = int(input())
for i in range(n):
    a = int(input())
  b=collections.Counter(a)
  print(len(b))

Submission status: Runtime Error

Solution code:
import sys
count = int(sys.stdin.readline())
zenbu = []

for x in range(count):
    keihin = sys.stdin.readline()

    if not keihin in zenbu:
        zenbu[len(zenbu)] = keihin
print(len(zenbu))

Submission status: Runtime Error

Solution code:
N = int(input())
L = []
if not (1 <= N <= 2*(10**5)):
    exit()


for i in range(N):
    d = input()
    if not (1 <= len(d) <= 10):
        exit()
    if not (d.lower() == d):
        exit()
    L.append(d)

print(len(set(L)))
root@stypr-ubuntu:~/1#

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a = map(int, input().split())
s = list(map(int, input().split()))

print(len(set(s)))

Submission status: Runtime Error

Solution code:
N=int(input())
a=[]
for i in N:
  a.append(input())
print(len(collections.Counter(a)))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N=int(input())
a=[]
for i in N:
  a.append=input()
print(len(collections.Counter(a)))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a,b,c,d=map(int,input().split())
while True:
	c-=b
	if c<=0:
		print("Yes")
		break
	a-=d
	if a<=0:
		print("No")
		break

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = int(input())
li = []
while len(li) <N:
  li.append(input())
print(len(set(lottery)))

Submission status: Runtime Error

Solution code:
N = int(input())
li = []
while len(li) <N:
  li.append(input())
print(len(set(lottery))

Submission status: Runtime Error

Solution code:
a = p.strip()
l = a.split()
m = l.pop(0)
print(len(set(l)))

Submission status: Runtime Error

Solution code:
a = p.strip()
l = a.split()
m = l.pop(0)
print(len(set(l))

Submission status: Runtime Error

Solution code:
n = int(input())
obj= []
for i in range (n):
	obj.append(input())
dictOfElems = dict()
for elem in obj:
  if elem in dictOfElems:
    dictOfElems[elem] += 1
  else:
    dictOfElems[elem] = 1
print(len(dict))

Submission status: Runtime Error

Solution code:
N = input("")
number = 0
inputs = []
while True:
    if len(inputs) != N:
        inp = str(input(""))
        inputs.append(str(inp))
    else:
        break
inputs_new = set(inputs)
for i in inputs_new:
    number += 1
print(number)

Submission status: Runtime Error

Solution code:
n = int(input())
obj= []
for i in range (n):
	obj.append(input())
dictOfElems = dict()
    # Iterate over each element in list
    for elem in obj:
        # If element exists in dict then increment its value else add it in dict
        if elem in dictOfElems:
            dictOfElems[elem] += 1
        else:
            dictOfElems[elem] = 1
print(len(dict))

Submission status: Runtime Error

Solution code:
s = '\n'.join(iter(input, ''))

a = list(set(list(s.split())))
print(len(a)-1)

Submission status: Runtime Error

Solution code:
n = int(input())
obj= []
for i in range (n)
	obj.append(input())
dictOfElems = dict()
    # Iterate over each element in list
    for elem in obj:
        # If element exists in dict then increment its value else add it in dict
        if elem in dictOfElems:
            dictOfElems[elem] += 1
        else:
            dictOfElems[elem] = 1
print(len(dict))

Submission status: Runtime Error

Solution code:
n = int(input())
li = [] * n
for i in range(0, n):
  li[i] = input()
nli = list(dict.fromkeys(li))
print(len(nli))

Submission status: Runtime Error

Solution code:
i = 0
S = []
T = []
N = int(input())
while i < N:
  S.append(input())
  i = i +1

p = 0

for Q in S:
  if not Q in T:
    T.append(S[i])
    p = p +1
print(p)

Submission status: Runtime Error

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

nli = list(dict.fromkeys(li))
print(len(nli))

Submission status: Runtime Error

Solution code:
p = input()
a = p.strip()
l = a.split()
m = l.pop(0)
print(len(set(l))

Submission status: Runtime Error

Solution code:
n = int(input())
counter = 0
s = "TEMP"
list = []

while n > 0:
  s = input()
  list.append(s)
  counter = 0
  for item in list:
    if item == s
      counter = counter - 1
    counter = counter + 1
  n = n - 1

print(counter)