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

static int compareFunction(const void *lhs, const void *rhs) {
  // 昇順(char)
  return strcmp(lhs, rhs);
}

int main() {
  int amount;
  scanf("%d", &amount);

  char kind[amount][11];
  for (int i = 0; i < amount; i += 1) {
    scanf("%s", *(kind + i));
  }
  // ソートして同じ種類のものを固める
  qsort(kind, amount, sizeof(*kind), compareFunction);

  // 1つ目の種類に関しては絶対カウント1するので1から始める
  // 同じので固まっていても違うものが出てきて初めてインクリメントなのでこれでOK
  // たとえ全部同じでも1が正解だし
  int output = 1;

  // index + 1 との比較になるため、i < amount - 1 が条件
  for (int i = 0; i < amount - 1; i += 1) {
    // 並べ替え後の1つ目2つ目...を比較して違っていたらカウントをインクリメント
    if (strcmp(*(kind + i), *(kind + i + 1)) != 0) {
      output += 1;
    }
  }

  printf("%d", output);
  printf("%c", '\n');

  return 0;
}