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, oc1) = head smo
  let (e1, ec1) = head sme
  let two sm = if length sm > 1 then sum . map snd . drop 1 $ sm else 0 
  let oc2 = two smo
  let ec2 = two sme
  let lvs = length vs
  print $ if o1 /= e1
          then lvs - oc1 - ec1
          else lvs - max (oc1 + ec2) (oc2 + ec1)