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

public class Main {

	public static void main(String args[]) {

		Scanner sc = new Scanner(System.in);

		ArrayList<Integer> evenNumList = new ArrayList<>();
		ArrayList<Integer> oddNumList = new ArrayList<>();
		HashMap<String, Integer> evenNumCnt = new HashMap<>();
		HashMap<String, Integer> oddNumCnt = new HashMap<>();

		int len = sc.nextInt();
		int result = 0;

		for (int i = 0; i < len; i++) {

			if (i==0 || i % 2 == 0) {
				hogehoge(sc.nextInt(), evenNumList, evenNumCnt);

			} else {
				hogehoge(sc.nextInt(), oddNumList, oddNumCnt);
			}
		}
      
        if (evenNumList.size() == 1
             && oddNumList.size() == 1
             && evenNumList.get(0) == oddNumList.get(0)) {
            result = len / 2;
        } else {

	    	if (evenNumList.size() != 1) {
		        result = getResult(evenNumList, evenNumCnt, len);
		    }
		    if (oddNumList.size() != 1) {
			    result += getResult(oddNumList, oddNumCnt, len);
		    }
        }

		System.out.println(result);
		sc.close();
	}

	public static void hogehoge(int num, ArrayList<Integer> list, HashMap<String,Integer> map) {

		String str = Integer.toString(num);

		if (list.contains(num)) {
			int cnt = map.get(str) + 1;
			map.put(str, cnt);

		} else {
			list.add(num);
			map.put(str, (int) 1);
		}
	}

	public static int getResult(ArrayList<Integer> list, HashMap<String,Integer> map, int len) {

		int tmpCnt = 0;
		int tmpNum = len / 2;
        int totalCnt = 0;

		for (int num : list) {

			int cnt = map.get(Integer.toString(num));

			if (cnt > tmpNum / 2) {
				return tmpNum - cnt;

			} else {

				if (tmpCnt < cnt) {
					tmpCnt = cnt;
                    totalCnt += cnt;
                  
                    if (totalCnt > tmpNum / 2) {
                        return tmpNum - tmpCnt;
                    }
				}
			}
		}
		return tmpNum - tmpCnt;
	}
}