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: Accepted)

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#define ll long long

int compare(const void *a, const void *b)
{
  return strcmp((char *)a, (char *)b);
}

int main(void)
{
  int n, i, count = 1;
  char s[11];
  char S[200002][11];
  scanf("%d", &n);
  for (i = 0; i < n; i++)
  {
    scanf("%s", S[i]);
  }
  qsort(S, n, 11, compare);
  for (i = 0; i < n - 1; i++)
  {
    if (!(strcmp(S[i], S[i + 1]) == 0))
    {
      count++;
    }
  } /*
    int *result = (int *)bsearch(s, S, count, 11, compare);
    if (result == NULL)
    {
      strcpy(S[count], s);
      count++;
      qsort(S, count, 11, compare);
    }
  }*/
  printf("%d\n", count);
  return 0;
}