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.util.Arrays;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);
		int a = sc.nextInt();
		int n[] = new int[a];
		
		for (int i=0; i<a; i++){
			n[i] = sc.nextInt();
		}
		
		int ttl[] = new int[a/2];
		for (int i=0; i<ttl.length; i++){
			ttl[i] = 0;
		}
		int j=0;
//		for (int j=0; j<a; j=j+2){
			int c1 = n[j];
			int c2 = n[j+1];
			int sum = 0;
			for (int i=0; i<a; i=i+2){
				
				if (c1 != n[i]){
					sum++;
				}
				if (c2 != n[i+1]){
					sum++;
				}
				if (c1 == c2){
					sum++;
				}
			}
			if (j == 0){
				ttl[j] = sum;
			}
			else {
				ttl[j/2] = sum;
			}
//		}
		
		Arrays.sort(ttl);
		System.out.println(ttl[0]);
		
		
	}

}