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)

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

void main() {

    int N;
    int i, j;
    int n = 0;
    int m;
    int chk;
    int count;
    int flag;
    char S[1000][11];
    char buf[1000];

    fgets(buf, sizeof(buf), stdin);
    sscanf(buf, "%d\n", &N);
    count = N;
    int k[N];

    for (i = 1; i <= N; i++) {
        fgets(buf, sizeof(buf), stdin);
        sscanf(buf, "%s\n", S[N]);
    }
    for (i = 1; i <= N; i++) {
        for (m = 0; m < n; m++) {
            flag = 0;
            if (k[m] == i) {
                flag = 1;
                break;
            } 
        }
        if (flag == 0) {
            for (j = N; j > i; j--){
                chk = strcmp(S[i], S[j]);
                if (0 == chk){
                    count--;
                    k[n] = S[j];
                    n++;
                }
            }
        }
    }
    printf ("%d", n+1);
    return;
}