program main
   implicit none
   integer:: n,num(2)=0,i
   integer,allocatable,dimension(:)::a,b,dum
   integer::ako(100000)=0,bko(100000)=0
   read(*,*)n
   allocate(dum(n),a(n/2),b(n/2))
   read(*,*)dum
   n=n/2
   do i=1,n
      a(i)=dum(i*2-1)
      b(i)=dum(i*2)
   enddo
   do i=1,n
      ako(a(i))=      ako(a(i))+1
      bko(b(i))=      bko(b(i))+1
   enddo
   call heapsort(n,ako)
   call heapsort(n,bko)
   if(maxloc(ako,1)/=maxloc(bko,1))then
      num(1)=n-maxval(ako)
      num(2)=n-maxval(bko)
      write(*,*)sum(num)
   else
      write(*,*)2*n-max(ako(1)+bko(2),bko(1)+ako(2))
   endif
contains
subroutine heapsort(n,array)
  implicit none
  integer,intent(in) :: n
  integer,intent(inout) :: array(1:n)
  
  integer ::i,k,j,l
  integer :: t
  
  if(n.le.0)then
     write(6,*)"Error, at heapsort"; stop
  endif
  if(n.eq.1)return

  l=n/2+1
  k=n
  do while(k.ne.1)
     if(l.gt.1)then
        l=l-1
        t=array(L)
     else
        t=array(k)
        array(k)=array(1)
        k=k-1
        if(k.eq.1) then
           array(1)=t
           exit
        endif
     endif
     i=l
     j=l+l
     do while(j.le.k)
        if(j.lt.k)then
           if(array(j).lt.array(j+1))j=j+1
        endif
        if (t.lt.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
