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<string.h>
#include<stdlib.h>

void swap(char *str1, char *str2) {
  char *tmp;
  if (strcmp(str1, str2)) {
    tmp = str1;
    str1 = str2;
    str2 = tmp;
  }
}

int main(void) {
  int count, i, j, duplication = 0;
  char *kuzi[10];



  if (scanf("%d", &count));
  for (i = 0; i < count; i++) {
    kuzi[i] = (char *)malloc(10 * sizeof(char));
  }
  for (i = 0; i < count; i++) {
    if(scanf("%s", kuzi[i]));
  }

  for (i = 0; i < count; i++) {
    for (j = count - 1; j >= 0; j--) {
      swap(kuzi[i], kuzi[j]);
    }
  }

  for (i = 0; i < count - 1; i++) {
    if (strcmp(kuzi[i], kuzi[i + 1]) == 0) {
      duplication++;
    } 
  }
  printf("%d", count - duplication);
  return 0;
}