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 Java (OpenJDK 1.8.0) (judge verdict: Wrong Answer)

import java.util.*;
import java.io.*;
 
public class Main {
    public static void main(String[] args) throws Exception {
        FastScanner sc = new FastScanner(System.in);
        PrintWriter pw = new PrintWriter(System.out);
        int n = sc.nextInt();
        HashMap<Integer,Integer> even = new HashMap<Integer,Integer>();
        HashMap<Integer,Integer> odd = new HashMap<Integer,Integer>();
        for(int i = 0; i < n; i++){
            int k = sc.nextInt();
            if(i % 2 == 0){
                even.put(k,even.getOrDefault(k,0)+1);
            }else{
                odd.put(k,odd.getOrDefault(k,0)+1);
            }
        }
        ArrayList<Map.Entry<Integer,Integer>> sortedOdd = new ArrayList<>(odd.entrySet());
        ArrayList<Map.Entry<Integer,Integer>> sortedEven = new ArrayList<>(even.entrySet());
        Collections.sort(sortedOdd, (o1, o2) -> o2.getValue()-o1.getValue());
        Collections.sort(sortedEven, (o1, o2) -> o2.getValue()-o1.getValue());
        if(sortedEven.get(0).getKey() == sortedOdd.get(0).getKey()){
            if(sortedOdd.size() > 1 && sortedEven.size() > 1){
                pw.println(n-Math.max(sortedEven.get(1).getValue()+sortedOdd.get(0).getValue(),sortedEven.get(0).getValue()+sortedOdd.get(1).getValue()));
            }else if(sortedOdd.size() > 1){
                pw.println(n-Math.max(sortedOdd.get(1).getValue()+sortedEven.get(0).getValue(),sortedOdd.get(1).getValue()));
            }else if(sortedEven.size() > 1){
                pw.println(n-Math.max(sortedEven.get(0).getValue(),sortedEven.get(1).getValue()+sortedOdd.get(0).getValue()));
            }else{
                pw.println(n-Math.max(sortedOdd.get(0).getValue(),sortedEven.get(0).getValue()));
            }
        }else{
            pw.println(n-sortedEven.get(0).getValue()-sortedOdd.get(0).getValue());
        }
        pw.flush();
    }

    static class GeekInteger {
        public static void save_sort(int[] array) {
            shuffle(array);
            Arrays.sort(array);
        }
 
        public static int[] shuffle(int[] array) {
            int n = array.length;
            Random random = new Random();
            for (int i = 0, j; i < n; i++) {
                j = i + random.nextInt(n - i);
                int randomElement = array[j];
                array[j] = array[i];
                array[i] = randomElement;
            }
            return array;
        }
 
    }
}

class FastScanner {
    private BufferedReader reader = null;
    private StringTokenizer tokenizer = null;
    public FastScanner(InputStream in) {
        reader = new BufferedReader(new InputStreamReader(in));
        tokenizer = null;
    }

    public String next() {
        if (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                tokenizer = new StringTokenizer(reader.readLine());
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken();
    }

    public String nextLine() {
        if (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                return reader.readLine();
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken("\n");
    }

    public long nextLong() {
        return Long.parseLong(next());
    }

    public int nextInt() {
        return Integer.parseInt(next());
    }

    public double nextDouble() {
         return Double.parseDouble(next());
    }
    
    public String[] nextArray(int n) {
        String[] a = new String[n];
        for (int i = 0; i < n; i++)
            a[i] = next();
        return a;
    }

    public int[] nextIntArray(int n) {
        int[] a = new int[n];
        for (int i = 0; i < n; i++)
            a[i] = nextInt();
        return a;
    }

    public long[] nextLongArray(int n) {
        long[] a = new long[n];
        for (int i = 0; i < n; i++)
            a[i] = nextLong();
        return a;
    } 
}