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 JavaScript (node.js v5.12) (judge verdict: Wrong Answer)

function main(input){
    var n = input.split("\n")[0];
    var v = input.split("\n")[1];
    var vArray = v.split(" ");

    var countAddMap = {};
    var countOddMap = {};
    var isAllSame = true;
    for (var i = 0; i < n / 2; i++){
	countOddMap[vArray[i*2]] = (countOddMap[vArray[i*2]] || 0) + 1;
	countAddMap[vArray[i*2+1]] = (countAddMap[vArray[i*2+1]] || 0) + 1;

        if(isAllSame && vArray[i*2] != vArray[i*2+1] ){
		isAllSame = false;
        }
    }
    if(isAllSame){
	return n/2;
    }
    if(Object.keys(countOddMap).length === 1 && Object.keys(countAddMap).length === 1){
        return 0;
    }

    var odd = changeCount(countOddMap, n / 2);
    var add = changeCount(countAddMap, n / 2)

    if(odd.minNum !== add.minNum){
	    return odd.min + add.min;
    }

    var oddNext = changeCount(countOddMap, n / 2, odd.minNum);
    var addNext = changeCount(countAddMap, n / 2, add.minNum);

    if(oddNext.min + add.min > odd.min + addNext.min){
        return odd.min + addNext.min;
    }
    return oddNext.min + add.min;
}

function changeCount(map, maxCount, filterNum){
    var max = maxNum(map);

    var min = maxCount;
    for(var num in map){
	var count = maxCount - map[num];
        if(count < min && num !== filterNum){
            min = count;
            minNum = num;
        }
    }
    return {min: min, minNum:minNum};
}

function maxNum(map){
    var max = 0;
    var maxNum = -1;
    Object.keys(map).forEach(function (num){
       if(map[num] > max){
           max = map[num];
           maxNum = num;
       }
    });
    return maxNum;
}

console.log(main(require("fs").readFileSync("/dev/stdin", "utf8")));