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 Java (OpenJDK 11.0.6) (judge verdict: Wrong Answer)

import java.util.*;
 
class Main {
  public static void main(String[] args) {
	Scanner sc = new Scanner(System.in);
    
    int N = sc.nextInt(); //next(文字列), nextDouble, nextLine(1行)とか
    String[] S  = new String[N];
    for (int i = 0; i < N; i++){
      S[i] = sc.next().strip();
    }
    int ans = 0;
    String temp;
    boolean[] test = new boolean[N];
    for(int i = 0; i < N-1;i++){
      temp = S[i];
      if(!test[i]){
        for(int j = i+1;j<N;j++){
          if (S[j].equals(temp)){
            test[i]=true;
            test[j]=true;           
          }
        }
      }
    }
    test[0] = false;
    for (int i = 0; i<N;i++){
      if(!test[i]){
        ans++;
      }
    }
    System.out.println(ans);        
  }
}