Problem:
Score : 300 points

Problem Statement

A sequence a_1,a_2,... ,a_n is said to be /\/\/\/ when the following conditions are satisfied:

For each i = 1,2,..., n-2, a_i = a_{i+2}.

Exactly two different numbers appear in the sequence.

You are given a sequence v_1,v_2,...,v_n whose length is even.
We would like to make this sequence /\/\/\/ by replacing some of its elements.
Find the minimum number of elements that needs to be replaced.

Constraints

2 \leq n \leq 10^5

n is even.

1 \leq v_i \leq 10^5

v_i is an integer.

Input

Input is given from Standard Input in the following format:

n
v_1 v_2 ... v_n

Output

Print the minimum number of elements that needs to be replaced.

Sample Input 1

4
3 1 3 2

Sample Output 1

1

The sequence 3,1,3,2 is not /\/\/\/, but we can make it /\/\/\/ by replacing one of its elements: for example, replace the fourth element to make it 3,1,3,1.

Sample Input 2

6
105 119 105 119 105 119

Sample Output 2

0

The sequence 105,119,105,119,105,119 is /\/\/\/.

Sample Input 3

4
1 1 1 1

Sample Output 3

2

The elements of the sequence 1,1,1,1 are all the same, so it is not /\/\/\/.

Solution in C (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <stdio.h>
#include <stdlib.h>

typedef char                SINT8;
typedef unsigned char       UINT8;
typedef short               SINT16;
typedef unsigned short      UINT16;
typedef int                 SINT32;
typedef unsigned int        UINT32;
typedef long long           SINT64;
typedef unsigned long long  UINT64;

#define MAX(a,b) ((a)>(b)?(a):(b))
#define MIN(a,b) ((a)<(b)?(a):(b))
#define ABS(a) ((a)>(0)?(a):-(a))


SINT32 main() {
    SINT32 a;
    SINT32 bbc;
    SINT32 ans;
    SINT32 AMAX = 0;
    SINT32 BMAX = 0;
    scanf("%d",&a);

    SINT32 dataA[200001] = {0};
    SINT32 dataB[200001] = {0};

    a = a/2;

    int buf;
    for (SINT32 i = 0; i < a; i++) {
        scanf("%d", &buf);
        dataA[buf]++;
        scanf("%d", &buf);
        dataB[buf]++;
    }

    for (SINT32 i = 0; i < 100001; i++) {
        if (dataA[i] > AMAX) {
            AMAX = dataA[i];
            bbc = i;
        }
    }
    for (SINT32 i = 0; i < 100001; i++) {
        if (dataB[i] > BMAX) {
            if (i != bbc) {
                BMAX = dataB[i];
            }
        }
    }


    ans = a-AMAX+a-BMAX;

    printf("%d\n",ans);
	return 0;
}