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: Wrong Answer)

#include <bits/stdc++.h>

#include <iostream>
using namespace std;
int main() {
  int64_t n;
  cin >> n;
  vector<string> type;
  type.reserve(2 * pow(10, 5));
  for (int64_t i = 0; i < n; ++i) {
    string si;
    cin >> si;
    bool is_exist = false;
    for (auto type_i : type) {
      if (type_i == si) {
        is_exist = true;
      }
    }
    if (!is_exist) {
      type.emplace_back(si);
    }
  }
  int64_t total = 0;
  for (auto type_i : type) {
    total += type_i.size();
  }
  cout << total << endl;
  return 0;
}