#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;

int main(){
  int N;
  cin>>N;
  vector<pair<int,int>> V;
  for(int i=0; i<=100000; ++i){
    V.push_back(make_pair(0,i));
  }
  
  vector<pair<int,int>> U;
  for(int i=0; i<=100000; ++i){
    U.push_back(make_pair(0,i));
  }
  
  for(int i=1; i<=N; ++i){
    int a;
    cin>>a;
    if(i%2==1) V[a].first += 1;
    else U[a].first += 1;
  }
  
  sort(V.begin(),V.end());
  reverse(V.begin(),V.end());
  
  sort(U.begin(),U.end());
  reverse(U.begin(),U.end());
  
  if(V[0].second==U[0].second) cout<<N-max(V[0].first+U[1].first,V[1].first+U[0].first)<<endl;
  else cout<<N-V[0].first-U[0].first<<endl;
}
