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 <iostream>
#include <bits/stdc++.h>

using namespace std;
string s[200002];
vector<int>v[300];
int main()
{
    int n, cnt=0;
    cin>>n;
    for(int i=0; i<n; i++)
    {
        cin>>s[i];
        int sum=0;
        for(int j=0; j<s[i].size()-1; j++)
        {
            sum+=s[i][j]-'a'+1;
        }
        if(v[sum].size()==0)
        {
            cnt++;
            v[sum].push_back(i);
        }
        else
        {
            cnt++;
            v[sum].push_back(i);
            for(int j=0; j<v[sum].size(); j++)
            {
                if(s[i]==s[v[sum][j]])
                {
                    cnt--;
                    v[sum].pop_back();
                    break;
                }
            }
        }
    }
    cout<<cnt;
    return 0;
}