#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
struct node
{
	int cnt, xx;
}_1[maxn], _2[maxn];
bool cmp(const node &a, const node &b)
{
    return a.cnt > b.cnt;
}
int n;
void slove()
{
    scanf("%d", &n);
	for (int x, i = 1; i <= n; ++ i)
    {
		scanf("%d", &x);
		if (i & 1) _1[x].cnt++, _1[x].xx = x;
		else _2[x].cnt++, _2[x].xx = x;
	}
	sort(_1 + 1, _1 + 100000 + 1, cmp);
	sort(_2 + 1, _2 + 100000 + 1, cmp);
	if (_1[1].xx != _2[1].xx)
        printf("%d\n", n - _1[1].cnt - _2[1].cnt);
	else
        printf("%d\n", n - max(_1[1].cnt + _2[2].cnt, _1[2].cnt + _2[1].cnt));
    return ;
}
signed main()
{
	slove();
	return 0;
}
