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.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.Map.Entry;
import java.util.Scanner;
import java.util.Set;

public class Main {

	@SuppressWarnings("resource")
	public static void main(String args[]) {
		Scanner scanner = new Scanner(System.in);
		int n = scanner.nextInt();
		Map<Integer, Integer> Gmap = new HashMap<>();
		Map<Integer, Integer> Kmap = new HashMap<>();
		Set<Integer>set=new HashSet<>();
		for (int i = 0; i < n; i++) {
			int key = scanner.nextInt();
			if (i % 2 == 0) {
				if (Gmap.containsKey(key)) {
					Gmap.put(key, Gmap.get(key) + 1);
				} else {
					Gmap.put(key, 1);
				}
			} else {
				if (Kmap.containsKey(key)) {
					Kmap.put(key, Kmap.get(key) + 1);
				} else {
					Kmap.put(key, 1);
				}
			}
			set.add(key);
		}
		
		if(set.size()==1) {
			System.out.println(n/2);
			return;
		}

		List<Entry<Integer, Integer>> GList = new ArrayList<Entry<Integer, Integer>>(Gmap.entrySet());
        Collections.sort(GList, new Comparator<Entry<Integer, Integer>>() {
            public int compare(Entry<Integer, Integer> obj1, Entry<Integer, Integer> obj2) {
                return obj2.getValue().compareTo(obj1.getValue());
            }
        });
        
        List<Entry<Integer, Integer>> KList = new ArrayList<Entry<Integer, Integer>>(Kmap.entrySet());
        Collections.sort(KList, new Comparator<Entry<Integer, Integer>>() {
            public int compare(Entry<Integer, Integer> obj1, Entry<Integer, Integer> obj2) {
                return obj2.getValue().compareTo(obj1.getValue());
            }
        });
        
        int ans=0;
        if(GList.get(0).getKey()!=KList.get(0).getKey()&&Gmap.size()!=1&&Kmap.size()!=1) {
        	ans=n-GList.get(0).getValue()-KList.get(0).getValue();
        }
        else if(GList.get(0).getKey()!=KList.get(0).getKey()&&Gmap.size()!=1) {
        	ans=n/2-GList.get(0).getValue();
        }
        else if(GList.get(0).getKey()!=KList.get(0).getKey()&&Kmap.size()!=1) {
        	ans=n/2-KList.get(0).getValue();
        }
        else if(GList.get(0).getKey()==KList.get(0).getKey()&&Gmap.size()!=1&&Kmap.size()!=1) {
        	ans=n-Math.max(GList.get(0).getValue()+KList.get(1).getValue(), GList.get(1).getValue()+KList.get(0).getValue());
        }
        else if(GList.get(0).getKey()==KList.get(0).getKey()&&Gmap.size()!=1) {
        	ans=n/2-GList.get(1).getValue();
        }
        else if(GList.get(0).getKey()==KList.get(0).getKey()&&Kmap.size()!=1) {
        	ans=n/2-KList.get(1).getValue();
        }
        
        System.out.println(ans);
        
	}
}