var Main = function(Input){
  // 行を分割
  var Lines = Input.split('\n');

  // 配列の要素数と、要素
  var Items = Number(Lines[0]);
  var Odd = {};
  var Even = {};

  Lines[1].split(' ').forEach(function(Item, Index){
    if(Index % 2 == 0){
      if(Odd[Item] == undefined){
        Odd[Item] = 1;
      } else {
        ++Odd[Item];
      }
    } else {
      if(Even[Item] == undefined){
        Even[Item] = 1;
      } else {
        ++Even[Item];
      }
    }
  });

  // 最頻出の文字と回数、2番目に多い文字と回数を求める
  var OddFreqCount = 0;
  var OddFreqItem = undefined;
  var OddFreqCount2 = 0;
  var OddFreqItem2 = undefined;

  var EvenFreqCount = 0;
  var EvenFreqItem = undefined;
  var EvenFreqCount2 = 0;
  var EvenFreqItem2 = undefined;

  for(var KeyO in Odd){
    if(OddFreqCount <= Odd[KeyO]){
      // もともと1番目だったものを2番目に
      if(OddFreqItem != undefined){
        OddFreqItem2 = OddFreqItem;
        OddFreqCount2 = OddFreqCount;
      }

      OddFreqItem = KeyO;
      OddFreqCount = Odd[KeyO];
    }
  }
  for(var KeyE in Even){
    if(EvenFreqCount <= Even[KeyE]){
      // もともと1番目だったものを2番目に
      if(EvenFreqItem != undefined){
        EvenFreqItem2 = EvenFreqItem;
        EvenFreqCount2 = EvenFreqCount;
      }

      EvenFreqItem = KeyE;
      EvenFreqCount = Even[KeyE];
    }
  }

  // 最頻出の数字が一致しない
  if(OddFreqItem != EvenFreqItem){
    var O = Items / 2 - OddFreqCount;
    var E = Items / 2 - EvenFreqCount;
    console.log(O + E);
    return;
  }

  // 一致する　→　Odd/Evenどちらのほうがより頻出するか
  if(OddFreqCount > EvenFreqCount){
    var O = Items / 2 - OddFreqCount;
    var E = Items / 2 - EvenFreqCount2;
    console.log(O + E);
    return;
  } else {
    var O = Items / 2 - OddFreqCount2;
    var E = Items / 2 - EvenFreqCount;
    console.log(O + E);
    return;
  }
}

// Main(require("fs").readFileSync('./180929C.txt', "utf8"));
Main(require('fs').readFileSync('/dev/stdin', 'utf8'));
