import qualified Data.ByteString.Char8 as BC
import Data.Maybe
import qualified Data.IntMap as IM
import Data.List
import Data.Ord

type Map = IM.IntMap Int

readIntsLine :: IO [Int]
readIntsLine = map (fst . fromJust . BC.readInt) . BC.words <$> BC.getLine

countUp :: Int -> Int -> Map -> Map
countUp = IM.insertWithKey f
  where f _ new old = old + new

count :: Int -> [Int] -> Map -> Map -> (Map, Map)
count c [] mo me = (mo, me)
count c (v:vs) mo me = count (c + 1) vs nextmo nextme
  where nextmo = if odd c then countUp v 1 mo else mo
        nextme = if even c then countUp v 1 me else me

main :: IO ()
main = do
  getLine
  vs <- readIntsLine
  let (mo, me) = count 1 vs IM.empty IM.empty
  let rsort = sortOn (Down . fst) . IM.toList
  let smo = rsort mo
  let sme = rsort me
  let o1 = head smo
  let e1 = head sme
  let o2 = if length smo > 1 then smo !! 1 else (fst o1, 0)
  let e2 = if length sme > 1 then sme !! 1 else (fst e1, 0)
  print $ if fst o1 /= fst e1
          then length vs - snd o1 - snd e1
          else length vs - max (snd o1 + snd e2) (snd o2 + snd e1)