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 (Clang 10.0.0) (judge verdict: Time Limit Exceeded)

#include <stdio.h>
#include <string.h>

int main(void)
{
    int N;
    char S[200000][11];
    char R[200001][11];
    int result = 0;

    scanf("%d", &N);
    
    for (int i = 0; i < N; i++) {
        scanf("%s", S[i]);
    }

    strcpy(R[0], S[0]);

    result = 1;
    int flag = 1;
    for (int i = 1; i < N; i++) {
        flag = 1;
        for (int j = 0; j < result; j++) {
            if (strcmp(S[i], R[j]) == 0) {
                flag = 0;
                break;
            }
        }
        if (flag) {
            strcpy(R[result], S[i]);
            result++;
        }
    }

    printf("%d\n", result);

    return 0;
}