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 Java8 (OpenJDK 1.8.0) (judge verdict: Wrong Answer)

import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
*/public class Main {
	public static void main(String[] args) {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		Scanner in = new Scanner(inputStream);
		PrintWriter out = new PrintWriter(outputStream);
		TaskC solver = new TaskC();
		solver.solve(1, in, out);
		out.close();
	}
static class TaskC   {
public void solve(int testNumber, Scanner in, PrintWriter out) {
        int N = in.nextInt();
        int ve[] = new int[N/2];
        int vo[] = new int[N/2];
        for (int i=0; i<N/2; i++) {
            ve[i] = in.nextInt();
            vo[i] = in.nextInt();
        }
        Arrays.sort(ve);
        Arrays.sort(vo);
        int idx1 = 0;
        int idx2 = 0;
        int oi1 = 0;
        int ei1 = 0;
        int oi2 = 0;
        int ei2 = 0;
        int nume = 0;
        int numo = 0;
        while (idx2 != N/2){
            while(ve[idx1] == ve[idx2]){
                idx2++;
                if(idx2 == N/2) break;
            }
            if(ei1 <= idx2 - idx1){
                ei2 = ei1;
                ei1 = idx2 - idx1;
                nume = ve[idx1];
            } else {
                ei2 = Math.max(ei2, idx2 - idx1);
            }
            idx1 = idx2;
        }
        idx1 = 0;
        idx2 = 0;
        while (idx2 != N/2){
            while(vo[idx1] == vo[idx2]){
                idx2++;
                if(idx2 == N/2) break;
            }
            if(oi1 <= idx2 - idx1){
                oi2 = oi1;
                oi1 = idx2 - idx1;
                numo = vo[idx1];
            } else {
                oi2 = Math.max(oi2, idx2 - idx1);
            }
            idx1 = idx2;
        }
        if(nume != numo) out.println(N - oi1 - ei1);
        else out.println(Math.max(N - oi1 - ei2, N - oi2 - ei1));
    }

}
}