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++14 (GCC 5.4.1) (judge verdict: Accepted)

#include<iostream>
#include<set>

using namespace std;

set<string> s;    //创建string的set容器

int main()
{
    int n;
    string str;
    while(cin >> n) {
        while(n--) {
            cin >> str;
            s.insert(str);  //插入数据，set容器只能这么写
        }
        cout << s.size() << endl; //返回set中元素个数
        s.clear();                //清空
    }
    return 0;
}