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>

// #define SIZE (200000)
#define SIZE (65536 * 256)
#define LEN (16)

char table[SIZE][LEN];

int hash(char *str)
{
        int i;
        int val;

        i = 0;
        val = 0;
        while(str[i] != '\0') {
                val = (val * 257 + str[i]) % SIZE;
                ++i;
        }
}

main()
{
        int i;
        int n;
        int s;
        char buf[LEN];

        s = 0;
        scanf("%d", &n);
        for(i = 0; i < n; ++i) {
                int j;
                int h;

                scanf("%s", buf);
                j = hash(buf);
                while(1) {
                        int idx;
                        if(strcmp(buf, table[j]) == 0) {
                                break;
                        }
                        if(table[(h + j) % SIZE][0] == '\0') {
                                strcpy(table[j], buf);
                                s++;
                                break;
                        }
                        j = (j + 1) % SIZE;
                }
        }
        printf("%d", s);
}