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<stdlib.h>
#include<string.h>

int cmp(const void *a, const void *b);

int main(){
  int n,ans=0;
  int i,j,c;
  scanf("%d",&n);
  char item[n][11];
  for(i=0;i<n;i++){
    scanf("%s",item[n]);
  }

  qsort(item,sizeof(item)/sizeof(char),sizeof(char),cmp); //昇順にソートする
  
  for(i=0;i<n;i++){
    if(strcmp(item[i],item[i+1])!=0) //strcmpが0を返すなら、2つの文字列は同じ
      ans++;
  }
    
  printf("%d",ans);
}

int cmp(const void *a, const void *b){ //比較関数
  return *(int *)a - *(int *)b;
}