#include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a), (b)) * (b))
using namespace std;
using ll = long long;
using ld = long double;
using vll = vector<ll>;
using vllvll = vector<vll>;
using pll = pair<ll, ll>;
template<class T>void print1d(T x,ll n=-1){if(n==-1)n=x.size();rep(i,0,n){cout<<x[i]<<' ';}cout<<'\n';}
template<class T>void print2d(T x,ll r=-1,ll c=-1){if(r==-1)r=x.size();if(c==-1)c=x[0].size();rep(i,0,r)print1d(x[i],c);}
template<class T, class U>bool haskey(T mp, U key) { return mp.find(key) != mp.end(); }
template<class T, class U>bool isin(T el, U container) { return find(all(container), el) != container.end(); }
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
template<class T>bool even(T n) { return ! (n & 1); }
template<class T>bool odd(T n) { return n & 1; }
template<class T>ld deg2rad(T deg) { return M_PI * deg / 180.0; }
template<class T>ld rad2deg(T rad) { return 180.0 * rad / M_PI; }
ll intpow(ll a,ll n){ll p=1;while(n){if(n&1)p*=a;a*=a;n>>=1;}return p;}
const long double pi = M_PI;
const long long big = 1LL << 50;
const long long inf = 1LL << 60;
const long long mod = 1e9 + 7;



int main()
{
        ll n;
        cin >> n;
        vll v(n);
        rep(i, 0, n) cin >> v[i];
        map<ll, ll> mp1;
        map<ll, ll> mp2;
        rep(i, 0, n) {
                mp1[v[i]]++;
                ++i;
        }
        rep(i, 1, n) {
                mp2[v[i]]++;
                ++i;
        }

        vector<pll> freq1;
        vector<pll> freq2;

        for (auto x : mp1) {
                freq1.push_back(pll{x.first, x.second});
        }
        for (auto x : mp2) {
                freq2.push_back(pll{x.first, x.second});
        }

        sort(all(freq1), [](auto a, auto b) {
                return a.second > b.second;
        });

        sort(all(freq2), [](auto a, auto b) {
                return a.second > b.second;
        });        

        ll l1 = len(freq1);
        ll l2 = len(freq2);
        ll ans = 0;

        ll tmp1 = n / 2 + (n % 2 != 0);
        ll tmp2 = n / 2;

        if (freq1[0].first != freq2[0].first and not (l1 == 1 and l2 == 1)) {
                ll ans1 = tmp1 - freq1[0].second;
                ll ans2 = tmp2 - freq2[0].second;
                cout << ans1 + ans2 << endl;
                return 0;
        }

        if (l1 == 1 and l2 == 1) {
                if (freq1[0].first != freq2[0].first) {
                        ans = 0;
                } else {
                        ans = n / 2;
                }
        } else if (l1 == 1 and l2 > 1) {
                ll ans1 = tmp1 - freq1[0].second;
                ll ans2 = tmp2 - freq2[1].second;
                ans = ans1 + ans2;
        } else if (l1 > 1 and l2 == 1) {
                ll ans1 = tmp1 - freq1[1].second;
                ll ans2 = tmp2 - freq2[0].second;
                ans = ans1 + ans2;
        } else {
                if (freq1[1].second > freq2[1].second) {
                        ll ans1 = tmp1 - freq1[1].second;
                        ll ans2 = tmp2 - freq2[0].second;
                        ans = ans1 + ans2;
                } else {
                        ll ans1 = tmp1 - freq1[0].second;
                        ll ans2 = tmp2 - freq2[1].second;
                        ans = ans1 + ans2;                       
                }
        }
        cout << ans << endl;
}

Measured memory_bytes: 12544