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>

struct list{
  char name[15];
  struct list *next;
};

struct list *talloc(){
  return (struct list *)malloc(sizeof(struct list));
}

char a[200007][14];
struct list *data[256000];

int main(){
  int n;
  int i,r,j;
  int ans = 0;
  int sum = 0;
  int flag = 0;
  struct list *p,*t;

  scanf("%d", &n);

  for(i = 0;i <= 255999;i++) data[i] = NULL;

  for(i = 0;i < n;i++){
    scanf("%s", a[i]);
    flag = 0;
    sum = 0;
    r = strlen(a[i]);
    for(j = 0;j < r;j++){
      sum += a[i][j];

      if(j == 3) sum += a[i][j]*2;
    }

    sum = sum % 256000;

    t = data[sum];
    while(t != NULL){
      if(strcmp(t -> name,a[i]) == 0){
        flag = 1;
        break;
      }
    }

    if(flag == 1) continue;

    else if(flag == 0){
      p = talloc();
      strcpy(p -> name,a[i]);
      p -> next = data[sum];
      data[sum] = p;
      ans++;
    }
  }

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

  return 0;
}