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 C# (Mono 4.6.2.0) (judge verdict: Accepted)

using System;
using System.Collections.Generic;
using System.Linq;

class Program
{

    static void Main()
    {
        int n = int.Parse(Console.ReadLine());
        string[] array = Console.ReadLine().Split();
        int[] v = new int[n];
        int[] e = new int[n / 2];
        int[] o = new int[n / 2];
        for (int i = 0; i < array.Length; i++)
        {
            v[i] = int.Parse(array[i]);
            if (i % 2 == 0) e[i / 2] = int.Parse(array[i]);
            else o[i / 2] = int.Parse(array[i]);
        }

        int e1 = -1;
        int e1_n = 0;
        int e2 = -1;
        int e2_n = 0;
        int o1 = -1;
        int o1_n = 0;
        int o2 = -1;
        int o2_n = 0;

        int[] line = new int[100001];

        for (int i = 0; i < e.Length; i++)
        {
            line[e[i]]++;
        }

        for (int i = 1; i < line.Length; i++)
        {
            if (e1_n < line[i])
            {
                e1 = i;
                e1_n = line[i];
            }
        }

        for (int i = 1; i < line.Length; i++)
        {
            if (i != e1 && e2_n < line[i])
            {
                e2 = i;
                e2_n = line[i];
            }
        }

        line = new int[100001];

        for (int i = 0; i < o.Length; i++)
        {
            line[o[i]]++;
        }

        for (int i = 1; i < line.Length; i++)
        {
            if (o1_n < line[i])
            {
                o1 = i;
                o1_n = line[i];
            }
        }

        for (int i = 1; i < line.Length; i++)
        {
            if (i != o1 && o2_n < line[i])
            {
                o2 = i;
                o2_n = line[i];
            }
        }

        if (e1 == o1)
        {
            Console.WriteLine(Math.Min(e.Length - e1_n + o.Length - o2_n, e.Length - e2_n + o.Length - o1_n));
        }
        else
        {
            Console.WriteLine(e.Length - e1_n + o.Length - o1_n);
        }
    }
}