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 Rust (1.15.1) (judge verdict: Wrong Answer)

use std::collections::HashMap;
use std::cmp::min;

macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let mut s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};

    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };

    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };

    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };

    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };

    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}

fn main(){
    input!{
        N: u32,
        V: [u32; N],
    }

    let mut M0: HashMap<u32, u32> = HashMap::new();
    let mut M1: HashMap<u32, u32> = HashMap::new();
    
    for (v, i) in V.iter().zip(0..N) {
        match i % 2 {
            0 => {
                let count = M0.entry(*v).or_insert(0);
                *count += 1;
            },
            1 => {
                let count = M1.entry(*v).or_insert(0);
                *count += 1;
            },
            _ => continue
        }
    }

    
    let mut max_m0 = [0, 0];
    let mut key_m0 = [0, 0];

    for (k, v) in M0.iter() {
        if v > &max_m0[0] {
            max_m0[1] = max_m0[0];
            max_m0[0] = *v;
            key_m0[1] = key_m0[0];
            key_m0[0] = *k;
        }
    }

    let mut max_m1 = [0, 0];
    let mut key_m1 = [0, 0];
    for (k, v) in M1.iter() {
        if v > &max_m1[0] {
            max_m1[1] = max_m1[0];
            max_m1[0] = *v;
            key_m1[1] = key_m1[0];
            key_m1[0] = *k;
        }
    }

    if key_m1 != key_m0 {
        println!("{}", N - max_m0[0] - max_m1[0]);
    } else {
        
        println!("{}", min(N - max_m0[1] - max_m1[0], N - max_m0[0] - max_m1[1]));
    }
}