#include<cstdio>
#include<algorithm>
using namespace std;
int n,v[100005],a[100005],b[100005];
int main(){
	scanf("%d",&n);for(int i=1;i<=n;++i) scanf("%d",&v[i]);
	for(int i=2;i<=n;i+=2) a[v[i]]++,b[v[i-1]]++;
	int c1=0,c2=0,k1,k2;
	for(int i=1;i<=100000;++i) {if(a[i]>c1) c1=a[i],k1=i;if(b[i]>c2) c2=b[i],k2=i;}
	if(k1==k2) {
		int c3=0,c4=0;
		for(int i=1;i<=100000;++i) {if(a[i]>c3&&k1!=i) c3=a[i];if(b[i]>c4&&k1!=i) c4=b[i];}
		printf("%d\n",min(n-c1-c3,n-c2-c4));
		return 0;
	}
	printf("%d\n",n-c1-c2);
	return 0;
}