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

int main(void){

    int ret, N;
    
    int k=0;
    
    int cmp=0;
    
    int flag=0;
    
    scanf("%d", &N);
    
    char S[N][10], T[N][10];
    
    for(int i=0; i<N; i++){
        
        ret=scanf("%s", S[i]);
        //printf("S1=%s\n", S[i]);
        
    }
    
    for(int l=0; l<N; l++){
        
        T[l][0]='\0';
        
    }
    
    for(int i=0; i<N; i++){
        
        for(int j =0; j<N; j++){
            
            cmp = strcmp(S[i], T[j]);
            
            if(cmp == 0){
                flag=1;
                break;
            }
            
        }
        
        if(flag == 0){
                //printf("S=%s\n", S[i]);
                strcpy(T[k], S[i]);
                k++;
                
            }else{flag=0;}
        
    }
    
    for(int i=0; i<N; i++){
        
        //printf("T=%s\n", T[i]);
        
    }
    
    printf("%d\n",k);
    
}