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

/* 比較関数(小->大) */
int compar(const char *val1, const char *val2) {
    if ( *val1 < *val2 ) {
        return -1;
    } else if ( *val1 == * val2 ) {
        return 0;
    } else {
        return 1;
    }
}

int main(){
    int N, count;
    char buf;
    char S[300000][20] = {};
    scanf("%d", &N);
    for(int i=0; i<N; i++){
        //ぶち込む
        scanf("%s", S[i]);
    }

    //ソートする
    qsort(S, N, sizeof(char)*20,
        (int (*)(const void *, const void *))compar
    );

    //ひとつ前と違ったらカウント増やす
    count = 1;
    for(int i=1; i<N; i++){
        if(strcmp(S[i-1], S[i]))count++;
    }

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

    return 0;
}