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: Time Limit Exceeded)

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

int main(){
    int N;
    char **ip;
    char **dic;

    int i,j;
    int count;
    while(scanf("%d",&N)<1);

    ip =(char **)malloc((N)*sizeof(char*)); 
    for(i=0;i<N;i++){
        ip[i]=(char *)calloc(11,sizeof(char));
    }
        dic =(char **)malloc(sizeof(char*)); 
        dic[0]=(char *)calloc(11,sizeof(char));
    int hoge;
    for(i=0;i<N;i++){
        hoge =scanf("%s",ip[i]);
    }
    //計算処理
    count = 0;
    int isRegister;
    char **tmp;
    for(i=0;i<N;i++){
        isRegister=0;
        //辞書に登録がなければ登録する
        for(j=0;j<count;j++){
            if(strcmp(ip[i],dic[j])==0&&isRegister==0){
                isRegister = 1;
            }
        }
        //登録がなければカウント+1
        if(isRegister==0){
        strcpy(dic[count],ip[i]);
        //dicの拡張
        count = count + 1;
        dic =(char **)realloc(dic,(count+1)*sizeof(char *)+count*sizeof(char)*11);
        dic[count]=(char *)calloc(11,sizeof(char));
        }
    }
    //最終出力 

    printf("%d",count);
    for(i=0;i<N;i++){
        free(ip[i]);
    }
    free(ip);
    for(i=0;i<count+1;i++){
        free(dic[i]);
    }
    free(dic);
    free(tmp);
    return 0;
}