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: Runtime Error)

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

int same(char* n, char* m) {
    int len = strlen(n);
    int len2 = strlen(m);
    if (len != len2) {
        return 0;
    }
    else {
        for (int i = 0; i < len; i++) {
            if (n[i] != m[i]) {
                return 0;
            }
        }
    }
    return 1;
}

int main(void) {
    int a;
    int ans = 0;
    scanf("%d", &a);

    char b[21000][11];
    int flag = 0;

    for (int i = 0; i < a; i++) {
        scanf("%s", &b[i]);
    }
    for (int i = 0; i < a; i++) {
        for (int j = i+1; j < a; j++) {
            if (same(b[i], b[j]) == 1) {
                flag = 1;
            }
        }
        if (flag == 0) {
            ans++;
        }
        flag = 0;
    }


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

    return 0;
}