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 Fortran (GNU Fortran 9.2.1) (judge verdict: Runtime Error)

   program abc164c
      implicit none
      integer::n
      character(10),allocatable::s1(:),s2(:) !元の配列、ソート後の配列
      integer::i,j,count
      integer,parameter::p=100

         read *, n
         allocate(s1(n),s2(n))
         do i=1,n
            read *,s1(i)
         end do

         do i=1,p
            call sort_quick(n, s1, s2)
         end do

         count=1
         do i=1,n-1
            if (s2(i)==s2(i+1)) cycle
            count=count+1
         end do

         print *, count
         stop



   contains
      subroutine sort_quick(num, a, b)
         implicit none
         integer, intent(in)  :: num
         character(10), intent(in):: a(num)
         character(10), intent(out) :: b(num)
         integer:: i, j
         character(10)::w

         ! 配列コピー
            b(:)=a(:)

         ! ソート処理
            call quick(1, num, num, b)
      end subroutine sort_quick

      recursive subroutine quick(left, right, num, a)
         implicit none
         integer, intent(in)    :: left, right, num
         character(10), intent(inout) :: a(num)
         integer :: i, j
         character(10)::s, w

            if (left >= right) return

         ! 最左項を軸に. 軸より小さいグループ. 軸より大きいグループ.
            s = a(left)
            i = left
            j = right + 1
            do
               i = i + 1
               do while (a(i) < s)
                  i = i + 1
               end do
               j = j - 1
               do while (a(j) > s)
                  j = j - 1
               end do
               if (i >= j) exit
           ! スワップ
               w    = a(i)
               a(i) = a(j)
               a(j) = w
            end do

        ! 軸を正しい位置に挿入
            a(left) = a(j)
            a(j)    = s
            call quick(left,  j - 1, num, a)  ! 左部分列に対する再帰呼び出し
            call quick(j + 1, right, num, a)  ! 右部分列に対する再帰呼び出し
      end subroutine quick

   end program abc164c