Problem:
Score: 300 points

Problem Statement

We have N voting papers. The i-th vote (1 \leq i \leq N) has the string S_i written on it.

Print all strings that are written on the most number of votes, in lexicographical order.

Constraints

1 \leq N \leq 2 \times 10^5

S_i (1 \leq i \leq N) are strings consisting of lowercase English letters.

The length of S_i (1 \leq i \leq N) is between 1 and 10 (inclusive).

Input

Input is given from Standard Input in the following format:

N
S_1
:
S_N

Output

Print all strings in question in lexicographical order.

Sample Input 1

7
beat
vet
beet
bed
vet
bet
beet

Sample Output 1

beet
vet

beet and vet are written on two sheets each, while beat, bed, and bet are written on one vote each. Thus, we should print the strings beet and vet.

Sample Input 2

8
buffalo
buffalo
buffalo
buffalo
buffalo
buffalo
buffalo
buffalo

Sample Output 2

buffalo

Sample Input 3

7
bass
bass
kick
kick
bass
kick
kick

Sample Output 3

kick

Sample Input 4

4
ushi
tapu
nichia
kun

Sample Output 4

kun
nichia
tapu
ushi

Solution in Fortran (gfortran v4.8.4) (judge verdict: Wrong Answer)

program main
      implicit none
      integer :: n, i, cnt, maxs
      character(10), allocatable :: s(:)

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

      call quicksort1( s, 1, n )

      cnt = 0
      maxs = 1
      do i = 1, n
        if ( s(i) == s(i+1) ) then
          cnt = cnt + 1
        else
          if ( maxs <= cnt ) then
            maxs = cnt
          end if 
          cnt = 0
        end if
      end do

      cnt = 0
      do i = 1, n
        if ( maxs == 1 ) then
              print *, s(i)
        else
          if ( s(i) == s(i+1) ) then
            cnt = cnt + 1
          else
            if ( maxs == cnt ) then
              print *, s(i)
            end if 
            cnt = 0
          end if
        end if
      end do

end program main
recursive subroutine quicksort1( namec, first, last )

  implicit none
  character(10), intent(inout) :: namec(*)
  integer,intent(in)::first,last
  !
  ! Original
  ! https://gist.github.com/t-nissie/479f0f16966925fa29ea
  !
  character(100)::x,t
  integer::i,j

  x = namec((first+last)/2)
  i = first
  j = last
  do
     do while ( LGT( x, namec(i) ) )
        i=i+1
     end do
     do while ( LGT( namec(j), x ) )
        j=j-1
     end do
     if (i >= j) exit
     t = namec(i)
     namec(i) = namec(j)
     namec(j) = t
     i=i+1
     j=j-1
  end do
  if (first < i-1) call quicksort1( namec, first, i-1  )
  if (j+1 < last)  call quicksort1( namec, j+1  , last )

  return

end subroutine quicksort1