#define _CRT_SECURE_NO_WARNINGS

/* include ***********************/
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>

/* define *************************/
//for
#define REP(i,n) for(int i=0,i##_len=(int)(n);i<i##_len;i++)
#define REPS(i,n) for(int i=1,i##_len=(int)(n);i<=i##_len;i++)
#define RREP(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define RREPS(i,n) for(int i=(int)(n);i>0;i--)
#define FOR(i,s,n) for(int i=(int)(s),i##_len=(int)(n);i<i##_len;i++)
#define RFOR(i,s,n) for(int i=(int)(s)-1,i##_len=(int)(n);i>=i##_len;i--)

//printf
#define PRINTD(d) printf("%d\n",(d))
#define PRINTL(d) printf("%lld\n",(d))

//memset
#define m0(s) memset(s,0,sizeof(s))
#define ml(s) memset(s,63,sizeof(s))
#define fill(s,c) memset(s,c,sizeof(s))

#define INF 1e9
#define MOD 1000000007

typedef long long ll;
typedef unsigned long long ull;

int diff[4][2] = {
	{ 0, -1 },
	{ -1, 0 },
	{ 1, 0 },
	{ 0, 1 },
};

int Min(int a, int b) {
	return (a)<(b) ? (a) : (b);
}
int  Max(int  a, int  b) {
	return (a) > (b) ? (a) : (b);
}
void Swap(int *a, int *b) {
	int tmp = *a;
	*a = *b;
	*b = tmp;
}void hSwap(int x[], int i, int j)
{
	int temp;

	temp = x[i];
	x[i] = x[j];
	x[j] = temp;
}

void ShowData(int x[], int left, int right)
{
	int i;
	for (i = left; i <= right; i++)printf("%d  ", x[i]);
	printf("\n");
}
void QSort(int x[], int left, int right, int n) {
	int i, j;	//左端,右端
	int pivot;	//軸

	i = left;
	j = right;
	pivot = x[(left + right) / 2];

	while (1) {
		if (n > 0) {				//n>0なら昇順、n<=0なら降順
			while ((x[i] < pivot) && (i <= right))i++;	//軸値より大きい要素
			while ((pivot < x[j]) && (i <= right))j--;	//軸値より小さい要素
		}
		else {
			while ((x[i] > pivot) && (i <= right))i++;	//軸値より小さい要素
			while ((pivot > x[j]) && (i <= right))j--;	//軸値より大きい要素
		}
		if (i >= j)	break;
		hSwap(x, i, j);
		i++; j--;
	}
	//ShowData(x, left, right);

	if (left < i - 1)QSort(x, left, i - 1, n);
	if (j + 1 <  right)QSort(x, j + 1, right, n);
}

int main() {
	int n;
	scanf("%d", &n);

	int a1[100000] = { 0 }, a2[100000] = { 0 };
	REP(i, n) {
		int v;
		scanf("%d", &v);
		v--;
		if (i % 2 == 0) {
			a1[v]++;
		}
		else {
			a2[v]++;
		}
	}
	int a1Max[2][2] = { 0 }, a2Max[2][2] = { 0 };
	REP(i, 100000) {
		if (a1[i] > a1Max[1][0]) {
			a1Max[1][0] = a1[i];
			a1Max[1][1] = i;
		}
		if (a1Max[1][0] > a1Max[0][0]) {
			int tmp[2];
			tmp[0] = a1Max[1][0];
			tmp[1] = a1Max[1][1];
			a1Max[1][0] = a1Max[0][0];
			a1Max[1][1] = a1Max[0][1];
			a1Max[0][0] = tmp[0];
			a1Max[0][1] = tmp[1];
		}

		if (a2[i] > a2Max[1][0]) {
			a2Max[1][0] = a2[i];
			a2Max[1][1] = i;
		}
		if (a2Max[1][0] > a2Max[0][0]) {
			int tmp[2];
			tmp[0] = a2Max[1][0];
			tmp[1] = a2Max[1][1];
			a2Max[1][0] = a2Max[0][0];
			a2Max[1][1] = a2Max[0][1];
			a2Max[0][0] = tmp[0];
			a2Max[0][1] = tmp[1];
		}
	}
	/*
	printf("%d:%d %d:%d %d:%d %d:%d\n", a1Max[0][0], a1Max[0][1], a1Max[1][0], a1Max[1][1],
		a2Max[0][0], a2Max[0][1], a2Max[1][0], a2Max[1][1]);
		*/
	if (a1Max[0][1] == a2Max[0][1]) {
		if (a1Max[0][0] + a2Max[1][0] >= a1Max[1][0] + a2Max[0][0]) {
			PRINTD(n - (a1Max[0][0] + a2Max[1][0]));
		}
		else {
			PRINTD(n- (a1Max[1][0] + a2Max[0][0]));
		}
	}
	else {
		PRINTD(n - (a1Max[0][0] + a2Max[0][0]));
	}
}

Measured memory_bytes: 896