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

program gacha;
type 
    arr = array[1..200000] of string;

var
    n, i, count : longint;
    list : arr;

procedure swap(var x: string; var y: string);
var tmp: string;
begin
    tmp := x;
    x := y;
    y := tmp;
end;

procedure quicksort(var x: arr; left, right: longint);
var 
    i, j: integer;
    k: string;

begin
    if (left < right) then begin  
        k := x[left]; 
        i := left; j := right;
        repeat 
            while (x[i] < k) and (i < right) do 
                i := i + 1;
            while (x[j] >= k) and (j > left) do 
                j := j - 1;
            if (i < j) then 
                swap(x[i], x[j])
        until (i >= j);
        quicksort(x, left, j);
        quicksort(x, j + 1, right);
    end;
end;

begin
    readln(n);
    for i := 1 to n do 
        readln(list[i]);
    quicksort(list, 1, n);
    count := 1;
    for i := 2 to n do begin
        if list[i - 1] <> list[i] then 
            inc(count);
    end;
    writeln(count);
end.