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 Ruby (2.3.3) (judge verdict: Wrong Answer)

require 'pp'
$DEBUG ? define_method(:dpp){|e|pp e} : define_method(:dpp){|e|}

# Nと空白区切の入力値を数値の配列で返却する
def gets_n_and_i_list()
  return gets.chomp.to_i, gets.chomp.split(" ").map(&:to_i)
end
N, a_list = gets_n_and_i_list

even_list = a_list.select.with_index{|e, i| i.even?}
odd_list  = a_list.select.with_index{|e, i| i.odd?}

even_h = even_list.group_by(&:itself).map{|k,v| [k, v.count] }.to_h
odd_h  = odd_list.group_by(&:itself).map{|k,v| [k, v.count] }.to_h

max_even = even_h.max{|x, y| x[1] <=> y[1]}
max_odd  = odd_h.max{|x, y| x[1] <=> y[1]}

if max_even[0] != max_odd[0]
  puts N - max_even[1] - max_odd[1]
else
  me = max_even[0]
  mo = max_odd[0]
  even_h.delete(me)
  odd_h.delete(mo)
  max_even = even_h.max{|x, y| x[1] <=> y[1]}
  max_odd  = even_h.max{|x, y| x[1] <=> y[1]}
  if max_even.nil? && max_odd.nil?
    puts N/2
  elsif max_even.nil?
    puts N - me + max_odd[1]
  elsif max_odd.nil?
    puts N - max_even[1] + mo
  else
    puts [N - me + max_odd[1], N - max_even[1] + mo].min
  end
end