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: Runtime Error)

import java.util.*; 
import java.lang.*; 

public class Main{
	public static void main(String[] args){
		Scanner scan = new Scanner(System.in);
		
		int N = scan.nextInt();
                String[] S = new String[N+1];
                String[] K = new String[N+1];
                int ans = 1;
                 
                
                for(int i=1; i<=N; i++){
                    S[i] = scan.next();
                }
                        K[1] = S[1];
                if(N>=2){
               for(int i=2; i<=N; i++){
                    for(int j=0; j<=ans; j++){
                        if(!(S[i].equals(K[j]))){
                           K[ans] = S[i];
                           ans++;
                        }
                    }
                }
                }
                System.out.println(ans);              
	}
}