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

int compare(const void *a, const void *b)
{
    return strcmp(a,b);
}

int main(void)
{
    int n;
    scanf("%d",&n);
    char s[n][11];
    int i,j;
    int count=0;
    int flag=0;

    scanf("%s",s[0]);
    for(i=1;i<n;i++)
    {
        scanf("%s",s[i]);
    }

    qsort(s,n,11,compare);
    for(j=0;j<n;j++)
    {
        if(strcmp(s[j],s[j+1])!=0)
        {
            count++;
        }
    }
    printf("%d",count);

    return 0;
}