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>
#include<stdio.h>
#include<string.h>
void Swap(char S[ ][11], int i, int j)
{
    char tmp[11];
    strcpy(tmp,S[i]);
    strcpy(S[i],S[j]);
    strcpy(S[j],tmp);
    return;
}

void QSort(char S[][11], int left, int right){
    int i, j;
    char pivot[11];
    
    i = left;
    j = right;
    
    strcpy(pivot,S[(left + right) / 2]);
    while (1) {
        while (strcmp(S[i],pivot) < 0){
            printf("%d ",i);
            i++;
        }
        while (strcmp(pivot,S[j]) < 0){
            j--;
        }
        if (i >= j){
            break;
        }
        
        Swap(S, i, j);
        i++;
        j--;
    }
   
    
    if (left < i - 1)
        QSort(S, left, i - 1);
    if (j + 1 <  right)
        QSort(S, j + 1, right);
}

int main(){
    int N;
    scanf("%d",&N);
    char S[N+1][11];
    for (int i=0; i<N; i++) {
        scanf("%s",S[i]);
    }
    QSort(S,0,N-1);
    int sum=1;
    for (int i=1; i<N; i++) {
    if(strcmp(S[i],S[i-1])!=0){
            sum++;
        }
    }
    
    printf("%d\n",sum);
    return 0;
}