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 Common Lisp (SBCL 2.0.3) (judge verdict: Accepted)

;;(declaim (optimize (speed 0) (safety 3) (debug 3)))
#+sbcl (declaim (sb-ext:unmuffle-conditions sb-ext:compiler-note))
(declaim (optimize (speed 3) (safety 0) (debug 0)))

(declaim (type fixnum *times*))
(defvar *times* (read))

(defvar *h* (make-hash-table :test #'equal
			     :size 10000))

(declaim (type fixnum *count*)) ;; *count* <= *times* < 2e5
(defvar *count* 0)

(dotimes (i *times*)
  (let ((line (read-line)))
    (unless (gethash line *h*)
      (incf *count*)
      (setf (gethash line *h*) t))))

(princ *count*)