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
    ar = array [1..200000] of string;
var n,i,c : longint;
    a : ar;
procedure QuickSort(var A : ar; left,right : longint);
var i,j : longint;
    p,temp : string;
begin
    i := left;
    j := right;
    p := A[(left + right) div 2];
    while i <= j do begin
        while A[i] < p do
            inc(i);
        while A[j] > p do
            dec(j);
        if i <= j then begin
            temp := A[i];
            A[i] := A[j];
            A[j] := temp;
            inc(i);
            dec(j);
        end;
    end;
    if left < j
        then QuickSort(A, left, j);
    if right > i
        then QuickSort(A, i, right);
end;

begin
    c := 1;
    readln(n);
    for i := 1 to n do
        readln(a[i]);
    QuickSort(a, 1, n);
    for i := 2 to n do
        if a[i] > a[i-1]
        then inc(c);
    writeln(c);
end.