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 Pascal (FPC 3.0.4) (judge verdict: Accepted)

program main;
type
    arraytype = array[1..200000] of string[10];
var
    i, n, count : longint;
    A : arraytype;

procedure Quicksort(var A : arraytype; left, right : integer);
var
   i, j : integer;
   pivot, temp : string;
begin
    i := left; 
    j := right;
    pivot := A[(left + right) div 2];
    while i <= j do begin
        while A[i] < pivot do 
            i := i + 1;
        while A[j] > pivot do 
            j := j - 1;
        if i <= j then begin 
            temp := A[i];
            A[i] := A[j];
            A[j] := temp;
            i := i + 1;
            j := j - 1;
        end;
    end;
    if left < j
        then Quicksort(A, left, j);
    if i < right 
        then Quicksort(A, i, right);
end;

begin
    //read
    readln(n);
    for i := 1 to n do 
        readln(A[i]);
    
    //sort
    Quicksort(A, 1, n);

    //count
    count := 1;
    for i := 2 to n do
       if A[i] <> A[i-1]
           then count := count + 1;
    writeln(count);
end.