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 Kotlin (1.0.0) (judge verdict: Accepted)

fun main(args: Array<String>) {
    val n = readLine()!!.toInt()
    val v = readLine()!!.split(' ').map(String::toInt)
    val odd = IntArray(100001)
    val eve = IntArray(100001)
    for (i in 0 until n) {
        if (i % 2 == 0) eve[v[i]]++
        else odd[v[i]]++
    }
    var mO = odd.max()!!
    var mE = eve.max()!!
    val dic = mutableSetOf<Int>()
    for (i in 1..100000) {
        if (odd[i] == mO) {
            dic.add(i)
            odd[i] = 0
        }
        if (eve[i] == mE) {
            dic.add(i)
            eve[i] = 0
        }
    }
    if (dic.size > 1) {
        println(n - mO - mE)
        return
    }
    var mO2 = odd.max()!!
    var mE2 = eve.max()!!
    var xx = Math.max(mO+mE2, mE+mO2)
    println(n - xx)
}