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

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

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

  // 最頻出の文字と回数、2番目に多い文字と回数を求める
  var OddFreqCount = 0;
  var OddFreqItem;
  var OddFrecCount2 = 0;
  var OddFreqItem2;
  var OddItemCount = 0;
  var EvenFreqCount = 0;
  var EvenFreqItem = 0;
  var EvenFreqCount2 = 0;
  var EvenFreqItem2;
  var EvenItemCount = 0;
  for(var Key in Odd){
    if(OddFreqCount <= Odd[Key]){
      OddFreqItem2 = OddFreqItem;
      OddFreqCount2 = OddFreqCount;
      OddFreqCount = Odd[Key];
      OddFreqItem = Key;
      ++OddItemCount;
    }
  }
  for(var Key in Even){
    if(EvenFreqCount <= Even[Key]){
      EvenFreqItem2 = EvenFreqItem;
      EvenFreqCount2 = EvenFreqCount;
      EvenFreqCount = Even[Key];
      EvenFreqItem = Key;
      ++EvenItemCount;
    }
  }

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

  // 一致する
  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'));
