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)

// AtCoder154 C

#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <math.h>
#include <assert.h>
#include <string.h>
#include <memory.h>
#include <malloc.h>
#include <stdlib.h>

int main() {

    int n, i, j;
    int* a; // 動的メモリの先頭アドレス用のポインタ
    char** s;
    char tmp_s[11];
    int cnt = 0;

    scanf("%d", &n);

    s = (char**)malloc(sizeof(char*) * n);
    for (i = 0; i < n; i++) {
        s[i] = (char*)malloc(sizeof(char) * 10);
    }

    for (i = 0; i < n; i++) {
        scanf("%s", tmp_s);
        for (j = 0; j < cnt; j++) {
            if (strcmp(tmp_s, s[j]) == 0) break;
        }
        if (j == cnt) {
            strcpy(s[cnt],tmp_s);
            cnt++;
        }
    }
    printf("%d", cnt);
    return 0;
}