#include<bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); ++i)
using namespace std;
using ll = long long int;

template <class T> ostream &operator<<(ostream &os, vector<T> &v) {
  for (auto i = v.begin(); i != v.end(); i++) {
    os << *i << " ";
  }
  return os;
}

const long long MOD = 1000000007;
// auto mod int
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=1329 : division
const int mod = 1000000007;
struct mint {
  ll x; // typedef long long ll;
  mint(ll x=0):x((x%mod+mod)%mod){}
  mint operator-() const { return mint(-x);}
  mint& operator+=(const mint a) {
    if ((x += a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator-=(const mint a) {
    if ((x += mod-a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;}
  mint operator+(const mint a) const { return mint(*this) += a;}
  mint operator-(const mint a) const { return mint(*this) -= a;}
  mint operator*(const mint a) const { return mint(*this) *= a;}
  mint pow(ll t) const {
    if (!t) return 1;
    mint a = pow(t>>1);
    a *= a;
    if (t&1) a *= *this;
    return a;
  }

  // for prime mod
  mint inv() const { return pow(mod-2);}
  mint& operator/=(const mint a) { return *this *= a.inv();}
  mint operator/(const mint a) const { return mint(*this) /= a;}
};
istream& operator>>(istream& is, const mint& a) { return is >> a.x;}
ostream& operator<<(ostream& os, const mint& a) { return os << a.x;}
// combination mod prime
// https://www.youtube.com/watch?v=8uowVvQ_-Mo&feature=youtu.be&t=1619
struct combination {
  vector<mint> fact, ifact;
  combination(int n):fact(n+1),ifact(n+1) {
    assert(n < mod);
    fact[0] = 1;
    for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i;
    ifact[n] = fact[n].inv();
    for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i;
  }
  mint operator()(int n, int k) {
    if (k < 0 || k > n) return 0;
    return fact[n]*ifact[k]*ifact[n-k];
  }
};


int main(){
  int n;
  cin>>n;
  vector<int> v(n);
  rep(i,n) cin>>v[i];
  map<ll,ll> e;
  map<ll,ll> o;
  for(int i=0; i<n; i+=2) {
    if(e.find(v[i])==e.end()) {
      e[v[i]] = 1;
    } else
      e[v[i]]++;
  }
  for(int i=1; i<n; i+=2) {
    if(o.find(v[i])==o.end()) {
      o[v[i]] = 1;
    } else
      o[v[i]]++;
  }
  vector<pair<ll,ll>> o_v;
  vector<pair<ll,ll>> e_v;
  for(auto p : o) {
    o_v.push_back(make_pair(p.second, p.first));
  }
  for(auto p: e) {
    e_v.push_back(make_pair(p.second, p.first));
  }
  sort(o_v.rbegin(), o_v.rend());
  sort(e_v.rbegin(), e_v.rend());
  ll o_m, e_m;
  if(o_v[0].second != e_v[0].second) {
    o_m = o_v[0].first;
    e_m = e_v[0].first;
  } else if(o_v.size()==1 and e_v.size()==1) {
    o_m = o_v[0].first;
    e_m = 0;
  } else if(o_v.size()==1 and e_v.size()!=1) {
    o_m = o_v[0].first;
    e_m = e_v[1].first;
  } else if(o_v.size()!=1 and e_v.size()==1) {
    o_m = o_v[1].first;
    e_m = e_v[0].first;
  } else if(o_v.size()!=1 and e_v.size()!=1) {
    if(o_v[0].first+e_v[1].first < e_v[0].first+o_v[1].first) {
      o_m = o_v[1].first;
      e_m = e_v[0].first;
    } else {
      o_m = o_v[0].first;
      e_m = e_v[1].first;
    }
  }
  

  std::cout << n/2-o_m + n/2-e_m << std::endl;
  return 0;
}


Measured memory_bytes: 9208