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)

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#define MAX(a, b) ((a) > (b) ? (a) : (b))

int main(void)
{
long N, index1, index2, count;
char S[200000][11];
char C[11];

  memset(&S, 0, sizeof(char)*200000*11);
  count = 0;
  
  scanf("%ld", &N);
  for (index1 = 0; index1 < N; ++index1) {
    scanf("%s", &C);
    for (index2 = 0; index2 < count; ++index2) {
      if (strcmp(C, S[index2]) == 0) break;
    }
    if (index2 == count) {
      strcpy(S[index2], C);
      count++;
    }
  }
  printf("%ld\n", count);
    
  return 0;
}