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 in C (GCC 9.2.1) (judge verdict: Wrong Answer)

#include<stdio.h>
int hash[100000010];
long long pre[20];
int main(){
  int n,i,j,len;
  char s[20];
  scanf("%d",&n);
  pre[0]=1;
  pre[1]=26;
  for (i=2;i<=15;i++)
    pre[i]=(pre[i-1]*77)%100000007;
  for (i=1;i<=n;i++)
  {scanf("%s",s);
   len=0;
   while (s[len]!=0) len++;
   long long sum=0;
   for (j=0;j<len;j++){
   	long long v=s[j]-96;
   	 sum=(sum+v*pre[j])%100000007;
   }
   sum=(sum*10+len)%100000007;
   hash[sum]=1;
	  }	
   int ans=0;
   for (i=0;i<100000007;i++)
     if (hash[i]==1)
       ans++;
    printf("%d",ans);
}