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.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.*;
import java.io.BufferedReader;
import java.io.InputStreamReader;

public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskD solver = new TaskD();
        solver.solve(1, in, out);
        out.close();
    }
    static class TaskD {
        public void solve(int testNumber, InputReader in, PrintWriter out){
            int ans = 0;
            int n = in.nextInt();
            int[] arr = new int[n];
            int[] mod1 = new int[100001];
            int[] mod2 = new int[100001];
            for (int i = 0; i <n ; i++) {
                arr[i]=in.nextInt();
            }
            for (int i = 0; i <n; i+=2){
                mod1[arr[i]]++;
            }
            for (int i = 1; i <n ; i+=2) {
                mod2[arr[i]]++;
            }
            int e1 = 0;
            int e2 = 0;
            int o1 = 0;
            int o2 = 0;
            for (int i = 1; i <mod1.length ; i++) {
                if (mod1[i] >= mod1[e1]) {
                    e2=e1;
                    e1=i;
                }
                else if (mod1[i] > e2) e2=i;
            }
            for (int i = 1; i <mod1.length ; i++) {
                if (mod2[i] >= mod2[o1]) {
                    o2=o1;
                    o1=i;
                }
                else if (mod2[i] > mod2[o2]){
                    o2=i;
                }
            }
            if (e1!=o1) System.out.println((n/2-mod1[e1]) + (n/2-mod2[o1]));
            else {
                System.out.println(Math.min((n/2-mod1[e2])+(n/2-mod2[o1]) , (n/2-mod1[e1])+(n/2-mod2[o2])));
            }
        }




    }

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }
        public int nextInt(){return  Integer.parseInt(next());}
        public long nextLong() {
            return Long.parseLong(next());
        }

    }
}