program main
  implicit none

  integer, allocatable :: x(:),y(:), b(:)
  integer :: n, i

  read(*,*) n

  allocate(x(n))
  allocate(y(n))
  allocate(b(n))


  read(*,*) x
  do i = 1, n
     y(i) = x(i)
  end do

  call heapsort(x)

  do i = 1, n
     if(y(i) <= x(n/2)) then
        b(i) = x(n/2 + 1)
     else
        b(i) = x(n/2)
     end if
     write(*,*) b(i)
  end do

  stop

  contains
  subroutine heapsort(array)
  implicit none
  integer, intent(inout) :: array(:)
  
  integer :: i,k,j,l
  double precision :: t
  
  if(n <= 0)then
     write(6,*)"Error, at heapsort"; stop
  endif
  if(n == 1)return

  l=n/2+1
  k=n
  do while(k /= 1)
     if(l > 1)then
        l=l-1
        t=array(L)
     else
        t=array(k)
        array(k)=array(1)
        k=k-1
        if(k == 1) then
           array(1)=t
           exit
        endif
     endif
     i=l
     j=l+l
     do while(j <= k)
        if(j < k)then
           if(array(j).lt.array(j+1))j=j+1
        endif
        if (t < array(j))then
           array(i)=array(j)
           i=j
           j=j+j
        else
           j=k+1
        endif
     enddo
     array(i)=t
  enddo

  return
end subroutine heapsort
  

end program main

  
