#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<cmath>
#include<map>
using namespace std;
int v[100005] = {};

int main() {
	int n; cin >> n;
	map<int, int> mp1, mp2;
	for (int i = 0; i < n; i++) {
		int v; 
		cin >> v;
		(i % 2 == 0 ? mp1[v]++ : mp2[v]++);
	}
	int a = 0, b = 0, c = 0, d = 0;
	int mx1 = 0, mx2 = 0;
	for (int i = 1; i <= 100000; i++) {
		if (mp1[i] >= a) {
			b = a;
			a = mp1[i];
			mx1 = i;
		}
		if (mp2[100000 - i] >= c) {
			d = c;
			c = mp2[100000 - i];
			mx2 = 100000 - i;
		}
	}
	if (mx1 != mx2) cout << n - a - c << endl;
	else {
		cout << min(n - a - d, n - b - c) << endl;
	}
	return 0;
	
}