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: Accepted)

import java.util.*;
 
public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
        
      String s[] = new String[N];//sの中でN回まわしていく
      for(int i=0; i<N; i++){
          s[i] =sc.next();//入力されるsが入る箱
      }
      Arrays.sort(s);//ソートを使い入力したNを並び替えていく
        int a =1;
        for(int j=0; j<N-1; j++){
            if(!s[j].equals(s[j+1])){//ソートで並び替えたことにより配列で順番ずつ文字列を比較することができる
                                     //apple[0]==apple[1],apple[1]==orange[2]
              a++;//異なった文字列はカウントしていく
            }
        }
        System.out.println(a);
      }
}