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.*;
import java.util.*;

public class Main {

	final static long MOD = 1000000007L;
	public static String[] Ws = null;
	public static int wsIndx = 0;
	public static BufferedReader in = null;
	public static ArrayList<int[]> list = new ArrayList<>();
	public static void main(String[] args) throws Exception {

		int n = nextInt();
		int[] v = nextInts();

		HashMap<Integer,Pair> oddMap = new HashMap<>();
		HashMap<Integer,Pair> evenMap = new HashMap<>();

		Pair p ;
		for(int i=0;i<n;i++){
			if(i%2==0){
				p = evenMap.getOrDefault(v[i], new Pair(v[i],0));
				p.V++;
				evenMap.put(v[i], p);
			}else{
				p = oddMap.getOrDefault(v[i], new Pair(v[i],0));
				p.V++;
				oddMap.put(v[i], p);
			}
		}
		Pair[] oddA = new Pair[oddMap.size()];
		Pair[] evenA = new Pair[evenMap.size()];

		int i=0;
		for(Pair x:oddMap.values()){
			oddA[i]=x;
			i++;
		}
		i=0;
		for(Pair x:evenMap.values()){
			evenA[i]=x;
			i++;
		}
		Arrays.sort(evenA,Pair.getComparator());
		Arrays.sort(oddA,Pair.getComparator());

		long ans =0;
		long tmpE;
		long tmpO;
		if(oddA.length!=1){
			tmpE = n-(evenA[0].V+oddA[1].V);
		}else{
			tmpE = n-(evenA[0].V+n/2);
		}
		if(evenA.length!=1){
			tmpO = n-(oddA[0].V+evenA[1].V);
		}else{
			tmpO = n-(oddA[0].V+n/2);
		}
//
//		if(evenA[0].N == oddA[0].N){
//			if(evenA[0].V==n/2&&oddA[0].V==n/2){
//				ans=n/2;
//			}else if(evenA[0].V==n/2){
//				ans=n/2-oddA[1].V;
//			}else if(oddA[0].V==n/2){
//				ans=n/2-evenA[1].V;
//			}else if(n-(evenA[0].V+oddA[1].V) <= n-(oddA[0].V+evenA[1].V)){
//				ans=n-(evenA[0].V+oddA[1].V);
//			}else{
//				ans=n-(oddA[0].V+evenA[1].V);
//			}
//		}else{
//
//		}
		ans=Math.min(tmpE, tmpO);
		if(evenA[0].N == oddA[0].N){
			if(evenA[0].V==n/2&&oddA[0].V==n/2){
				ans=n/2;
			}
		}
		System.out.println(ans);


	}

public static class Pair {
	int N;
	int V;


	Pair(int N, int V) {
		this.N = N;
		this.V = V;
	}

	public int getN() {
		return N;
	}

	public int getV() {
		return V;
	}

	public static Comparator<Pair> getComparator() {
		return Comparator.comparing(Pair::getV ,Comparator.reverseOrder());
	}
}
	public static String[] toStringArray(String s) {
		String[] tmp = new String[s.length()];
		char[] c = s.toCharArray();
		for (int i = 0; i < tmp.length; i++) {
			tmp[i] = String.valueOf(c[i]);
		}
		return tmp;
	}

	public static String concatStringArray(String[] s){
		StringBuffer sb = new StringBuffer();
		for(String x:s){
			sb.append(x);
		}
		return sb.toString();
	}

	public static void check() throws Exception{
		if(in == null){
			in = new BufferedReader(new InputStreamReader(System.in));
		}
		if(Ws==null || Ws.length<=wsIndx){
			Ws = in.readLine().split(" ");
			wsIndx=0;
		}
	}
	public static int nextInt()throws Exception{
		check();
		return Integer.parseInt(Ws[wsIndx++]);
	}

	public static long nextLong()throws Exception{
		check();
		return Long.parseLong(Ws[wsIndx++]);
	}

	public static String nextString()throws Exception{
		check();
		return Ws[wsIndx++];
	}

	public static int[] nextInts()throws Exception{
		check();
		int[] tmp = new int[Ws.length];
		for(int i=0;i<tmp.length;i++){
			tmp[i]=Integer.parseInt(Ws[i]);
		}
		wsIndx=Ws.length;
		return tmp;
	}

	public static long[] nextLongs()throws Exception{
		check();
		long[] tmp = new long[Ws.length];
		for(int i=0;i<tmp.length;i++){
			tmp[i]=Long.parseLong(Ws[i]);
		}
		wsIndx=Ws.length;
		return tmp;
	}

	public static String[] nextStrings()throws Exception{
		check();
		wsIndx=Ws.length;
		return Ws;
	}


}