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.*;

public class Main {

  static Scanner sc = new Scanner(System.in);

  static int N;

  public static void main(String[] args) {

    int n = sc.nextInt();
    N = n/2;

    ArrayList<Integer> a = new ArrayList(N);
    ArrayList<Integer> b = new ArrayList(N);

    for (int i=0; i<N; i++) {
      a.add(sc.nextInt());
      b.add(sc.nextInt());
    }

    ArrayList<Integer[]> rankingA = getRanking(a); //[0] 個数 [1] 数値
    ArrayList<Integer[]> rankingB = getRanking(b);

    if (rankingA.get(0)[1] != rankingB.get(0)[1] || rankingA.get(0)[0] == rankingA.get(1)[0] || rankingB.get(0)[0] == rankingB.get(1)[0]) {
      System.out.println(2 * N - rankingA.get(0)[0] - rankingB.get(0)[0]);
    } else {
      if (rankingA.get(0)[0] + rankingB.get(1)[0] > rankingA.get(1)[0] + rankingB.get(0)[0]) {
        System.out.println(2 * N - rankingA.get(0)[0] - rankingB.get(1)[0]);
      } else {
        System.out.println(2 * N - rankingA.get(1)[0] - rankingB.get(0)[0]);
      }
    }

  }

  static ArrayList<Integer[]> getRanking(ArrayList<Integer> list) {
    ArrayList<Integer[]> ranking = new ArrayList(N);
    for (int i=0; i<N;) {
      for (int j=i; j<=N; j++) {
        if (j == N || list.get(j) != list.get(i)) {
          ranking.add(new Integer[]{j-i, list.get(i)});
          i = j;
          break;
        }
      }
    }

    ranking.sort((x, y) -> x[0]-y[0]);

    if (ranking.size() == 1) {
      ranking.add(new Integer[]{0, -1});
    }

    return ranking;
  }

}