#include "bits/stdc++.h"

// Begin Header {{{
using namespace std;

#ifndef DEBUG
#define dump(...)
#endif

#define all(x) x.begin(), x.end()
#define rep(i, n) for (intmax_t i = 0, i##_limit = (n); i < i##_limit; ++i)
#define reps(i, b, e) for (intmax_t i = (b), i##_limit = (e); i <= i##_limit; ++i)
#define repr(i, b, e) for (intmax_t i = (b), i##_limit = (e); i >= i##_limit; --i)
#define var(Type, ...) Type __VA_ARGS__; input(__VA_ARGS__)

constexpr size_t    operator""_zu(unsigned long long value) { return value; };
constexpr intmax_t  operator""_jd(unsigned long long value) { return value; };
constexpr uintmax_t operator""_ju(unsigned long long value) { return value; };

constexpr int INF = 0x3f3f3f3f;
constexpr intmax_t LINF = 0x3f3f3f3f3f3f3f3f_jd;

template <class T, class Compare = less<>>
using MaxHeap = priority_queue<T, vector<T>, Compare>;
template <class T, class Compare = greater<>>
using MinHeap = priority_queue<T, vector<T>, Compare>;

inline void input() {}
template <class Head, class... Tail>
inline void input(Head&& head, Tail&&... tail) {
    cin >> head;
    input(forward<Tail>(tail)...);
}

template <class T>
inline istream& operator>>(istream &is, vector<T> &vec) {
    for (auto &e: vec) {
        is >> e;
    }
    return is;
}

inline void output() { cout << "\n"; }
template <class Head, class... Tail>
inline void output(Head&& head, Tail&&... tail) {
    cout << head;
    if (sizeof...(tail)) {
        cout << " ";
    }
    output(forward<Tail>(tail)...);
}

template <class T>
inline ostream& operator<<(ostream &os, const vector<T> &vec) {
    static constexpr const char *delim[] = {" ", ""};
    for (const auto &e: vec) {
        os << e << delim[&e == &vec.back()];
    }
    return os;
}

template <class T>
inline vector<T> makeVector(const T &initValue, size_t sz) {
    return vector<T>(sz, initValue);
}

template <class T, class... Args>
inline auto makeVector(const T &initValue, size_t sz, Args... args) {
    return vector<decltype(makeVector<T>(initValue, args...))>(sz, makeVector<T>(initValue, args...));
}

template <class Func>
class FixPoint : Func {
public:
    explicit constexpr FixPoint(Func&& f) noexcept : Func(forward<Func>(f)) {}

    template <class... Args>
    constexpr decltype(auto) operator()(Args&&... args) const {
        return Func::operator()(*this, std::forward<Args>(args)...);
    }
};

template <class Func>
static inline constexpr decltype(auto) makeFixPoint(Func&& f) noexcept {
    return FixPoint<Func>{forward<Func>(f)};
}

template <class T>
inline bool chmax(T &a, const T &b) noexcept {
    return b > a && (a = b, true);
}

template <class T>
inline bool chmin(T &a, const T &b) noexcept {
    return b < a && (a = b, true);
}

template <class T>
inline T diff(const T &a, const T &b) noexcept {
    return a < b ? b - a : a - b;
}
// End Header }}}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    var(size_t, n);

    vector<intmax_t> v(n);
    input(v);

    set<intmax_t> S;
    vector<intmax_t> odd_v, even_v;
    auto cnt = makeVector<intmax_t>(0, 2, 1e5 + 1); // 0: odd, 1: even
    rep(i, n) {
        cnt[i & 1][v[i]]++;
        S.insert(v[i]);
        (i & 1 ? even_v : odd_v).emplace_back(v[i]);
    }

    if (S.size() == 1) {
        return output(n / 2), 0;
    }

    sort(odd_v.begin(), odd_v.end());
    odd_v.erase(unique(odd_v.begin(), odd_v.end()), odd_v.end());
    sort(all(odd_v), [&](intmax_t x, intmax_t y) { return cnt[0][x] > cnt[0][y]; });

    sort(even_v.begin(), even_v.end());
    even_v.erase(unique(even_v.begin(), even_v.end()), even_v.end());
    sort(all(even_v), [&](intmax_t x, intmax_t y) { return cnt[1][x] > cnt[1][y]; });

    const auto f = [&](const intmax_t oddValue, const intmax_t evenValue) -> intmax_t {
        intmax_t ret = 0;
        rep(i, n) {
            if (i & 1) {
                ret += (v[i] != evenValue);
            } else {
                ret += (v[i] != oddValue);
            }
        }
        return ret;
    };

    intmax_t res = INF;
    if (odd_v[0] == even_v[0]) {
        if (odd_v.size() >= 2) {
            chmin(res, f(odd_v[1], even_v[0]));
        }
        if (even_v.size() >= 2) {
            chmin(res, f(odd_v[0], even_v[1]));
        }
    } else {
        chmin(res, f(odd_v[0], even_v[0]));
    }

    output(res);

    return 0;
}


Measured memory_bytes: 8048