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

typedef struct _node 
{
    char s[15];
    struct _node *next ;
} node;


int main()
{
    int i;
    int n;
    char p[15];
    node *list = malloc(sizeof(node));
    list->next = NULL;

    scanf("%d",&n);

    node *ptr;
    node *dummy;

    for(i=0;i<n;i++)
    {
        ptr = list;
        scanf("%s",p);

        while(ptr->next != NULL)
        {
            if(strcmp(p,ptr->next->s) >= 0)
                break;

            ptr = ptr->next;
        }


        dummy = malloc(sizeof(node));
        strcpy(dummy->s,p);
        dummy->next = ptr->next;
        ptr->next = dummy;
    }

    ptr = list->next;

    int ans = 1;

    while(ptr->next != NULL)
    {
        ans ++;

        if(strcmp(ptr->s,ptr->next->s)==0)
            ans --;

        ptr = ptr->next;
    }
    
    printf("%d\n",ans);

    return 0;
}