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: Accepted)

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

int asc(const void *a, const void *b) {
  return *(int *)a - *(int *)b;
}

int main(void)
{
    int N, i, j, f;
    char S[200001][20];
    int count=1;

    scanf("%d",&N);
    for(i=0; i<N; i++){
        for(j=0; j<11; j++) S[i][j] = '\0';//初期化
        scanf("%s",S[i]);
    }

    qsort(S,N,sizeof(char[20]),strcmp);

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

    printf("%d\n",count);

    return 0;
}