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: Runtime Error)

program main;
var n,i,j,c : longint;
    a : array[1..10000] of string;
    t : boolean;
begin
    c := 0;
    t := true;
    readln(n);
    for i := 1 to n do begin
        readln(a[i]);
        if i > 1 then
        for j := 1 to i-1 do
            if a[i] = a[j]
            then t := false;
        if t = true
        then inc(c)
        else t:=true;
    end;
    writeln(c);
end.