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

#include<stdio.h>
#include<math.h>
#include<string.h>
#include<stdlib.h>
int main(){
 long long n;
 scanf("%lld ",&n);
 char s[n][10],t[n][1];
 long long a,b,c;
 for(a=0;a<n;a++)
  scanf("%s ",s[a]); 
  
 /*qsort(s,n,sizeof(char*),strcmp);*/
  
 for(a=0;a<n;a++)
  for(b=a+1;b<n;b++){
   if(strcmp(s[a],s[b])>0){
    strcpy(t[n],s[a]);
    strcpy(s[a],s[b]);
    strcpy(s[b],t[n]);}
  }
 long long ans=0;
 for(a=0;a<n;a++)
  if(strcmp(s[a],s[a+1])!=0)ans++;
  
 printf("%lld\n",ans);
  
return 0;}