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 1.8.0) (judge verdict: Accepted)

import java.util.Scanner;
import java.util.HashMap;

public class Main {
    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner(System.in);
        
        int N = sc.nextInt();
        String[] B = new String[(int)(N)];
        
        for(int i = 0 ; i < N ; i++){
                B[i] = sc.next();
                
        }
        HashMap<String, Integer> m = new HashMap<String, Integer>();
        int a = 0;
        for (String s : B) {
        int v = 0;
        if (m.containsKey(s)) {
        // Mapに登録済み
        v = m.get(s) + 1;
        a++;
        } else {
        // Mapに未登録
        v = 1;
        }
        m.put(s, v);
        }
        
        System.out.println(N - a);
     }
}