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# (Mono-mcs 6.8.0.105) (judge verdict: Time Limit Exceeded)

using System;
class abc164_c{
  public static void Main(){
    int n = int.Parse(Console.ReadLine());
    int[] count = new int[10];
    int total = 0;
    bool flag;
    String[,] prize = new String[10,n];
    for(int i=0; i<10; i++){
      count[i] = 0;
    }
    for(int x=0; x<n; x++){
      flag = true;
      String str = Console.ReadLine();
      for(int i=0; i<count[str.Length-1] && flag; i++){
        if(str.Equals(prize[str.Length-1,i])){
          flag = false;
          break;
        }
      }
      if(flag){
        prize[str.Length-1,count[str.Length-1]] = str;
        count[str.Length-1]++;
        total++;
      }
    }
    Console.WriteLine(total);
  }
}