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 <iostream>
#include <algorithm>
#include <vector>
#include <bits/stdc++.h>
using namespace std;

bool isKaibun(string s);

int main()
{
   int num;
   cin >> num;
   //景品の種類が、すでに持っている景品の種類と一致しているかみて、一致していなければインクリメントする

   string temp;
   int ans = 0;

   vector<string> list(num+1, "111");

   //くじ引き1つ1つについて確認
   for ( int i = 1; i <= num; i++)
   {
       cin >> temp;

       for(int k = 1; k <= num; k++)
       {
           if(list[k] == "111")
           {
               list[k] = temp;
               ans++;
               break;
           }

           if(list[k] == temp)
           {
               //重複している
               break;
           }
       }
   }

   cout << ans << endl;
   
}