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: Time Limit Exceeded)

import java.util.Scanner;
public class Main{
 public static void main(String[] args) {
   Scanner kbd = new Scanner(System.in);
   int n=kbd.nextInt();
   String[] A= new String[n+1];
   for(int i=0;i<n;i++){
     A[i]=kbd.next();
}
int x=0;
sortTableByName(A,n);
for(int i=0;i<n;i++){
if(!(A[i].equals(A[i+1]))){
  x=x+1;
}
}
System.out.println(x);
}


public static void sortTableByName(String[] A, int num) {
 String temp;
 for (int i = 0; i < num-1; i++) {
  for (int j = i + 1; j < num; j++) {
   if (A[i].compareTo(A[j]) >0) {
    temp = A[i];
    A[i] = A[j];
    A[j] = temp;
   }
  }
 }
}
}