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

//ABC164C-2
 int main(void) {
  int n, k, i, cou=1, tmp;
  scanf("%d", &n);
  char s[n][10];
  for(i=0; i < n; i++){
    scanf("%s", s[i]);
  }
  qsort(s, n, sizeof(char)*10, strcmp);//文字列ソート

  for(i=0; i < n-1; i++){
    if(strcmp(s[i],s[i+1])!=0)cou++;
    //printf("%c\n",s[i][0]);
  }
  printf("%d",cou);

}