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

public class Main{
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int v;
        

        Map<Integer, Integer> map_gu = new HashMap<Integer, Integer>();
        Map<Integer, Integer> map_ki = new HashMap<Integer, Integer>();

        int countResult = 0;

        for(int i = 1; i<=n; i++){
            int key = sc.nextInt();
            if(i%2 == 0) {
                if (map_gu.containsKey(key)) {
                    v = map_gu.get(key) + 1;
                } else {
                    v = 1;
                }
                map_gu.put(key, v);
            } else{
                if (map_ki.containsKey(key)) {
                    v = map_ki.get(key) + 1;
                } else {
                    v = 1;
                }
                map_ki.put(key, v);
            }
        }

        map_gu.entrySet().stream()
                .sorted(java.util.Collections.reverseOrder(java.util.Map.Entry.comparingByValue()));

        map_ki.entrySet().stream()
                .sorted(java.util.Collections.reverseOrder(java.util.Map.Entry.comparingByValue()));

        int kizikuGu = 0;
        int kizikuKi = 0;

        int secondValueGu = 0;
        int secondValueKi = 0;

        for(Iterator<Integer> iterator = map_gu.keySet().iterator(); iterator.hasNext(); ) {
            kizikuGu = iterator.next();
            if(iterator.hasNext()) {
                secondValueGu = iterator.next();
            }
            break;
        }

        for(Iterator<Integer> iterator = map_ki.keySet().iterator(); iterator.hasNext(); ) {

            kizikuKi = iterator.next();
            if(iterator.hasNext()) {
                secondValueKi = iterator.next();
            }
            break;
        }

        if(kizikuGu == kizikuKi) {
            if(map_gu.get(kizikuGu) > map_ki.get(kizikuKi)){
                kizikuKi = secondValueKi;

            }
            if(map_gu.get(kizikuGu) < map_ki.get(kizikuKi)){
                kizikuGu =secondValueGu;

            }
            if(map_gu.get(kizikuGu) == map_ki.get(kizikuKi)){
                countResult = map_gu.get(kizikuGu);
            }
        }




        for(Map.Entry<Integer, Integer> entry : map_gu.entrySet()) {
            if(entry.getKey() == kizikuGu){
                continue;
            }
            countResult += entry.getValue();
        }


        for(Map.Entry<Integer, Integer> entry : map_ki.entrySet()) {
            if(entry.getKey() == kizikuKi){
                continue;
            }
            countResult += entry.getValue();
        }


        System.out.print(countResult);


    }
}