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.File;
import java.io.IOException;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.Deque;
import java.util.List;
import java.util.Scanner;

public class Main {
 
	public static void main(String[] args) throws IOException {
		//File file = new File("input.txt");
		//Scanner sc = new Scanner(file);
		
		Scanner sc = new Scanner(System.in);
		
		int n = sc.nextInt();
		
		int[] rel_even = new int[100000];
		int[] rel_odd = new int[100000];
		
		for(int i = 0; i < n; i++){
			int v = sc.nextInt() - 1;
			if(i % 2 == 0) rel_odd[v]++;
			else rel_even[v]++;
		}
		
		int max_even_num1 = 0, max_even_num2 = 0, max_odd_num1 = 0, max_odd_num2 = 0;
		int max_even_index1 = 0, max_even_index2 = 0, max_odd_index1 = 0, max_odd_index2 = 0;
		
		for(int i = 0; i < 100000; i++){
			if(rel_odd[i] > max_odd_num2 && rel_odd[i] > max_odd_num1){
				max_odd_num1 = rel_odd[i];
				max_odd_index1 = i;
			}else if(rel_odd[i] > max_odd_num2 && rel_odd[i] < max_odd_num1){
				max_odd_num2 = rel_odd[i];
				max_odd_index2 = i;
			}
		}
		
		for(int i = 0; i < 100000; i++){
			if(rel_even[i] > max_even_num2 && rel_even[i] > max_even_num1){
				max_even_num1 = rel_even[i];
				max_even_index1 = i;
			}else if(rel_even[i] > max_even_num2 && rel_even[i] < max_even_num1){
				max_even_num2 = rel_even[i];
				max_even_index2 = i;
			}
		}
		
		if(max_odd_index1 != max_even_index1){
			System.out.println(n - max_even_num1 - max_odd_num1);
		}else{
			int diff1 = max_even_num1 + max_odd_num2;
			int diff2 = max_even_num2 + max_odd_num1;
			if(diff1 > diff2) System.out.println(n - diff1);
			else System.out.println(n - diff2);
		}
	}
}