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 PyPy3 (2.4.0) (judge verdict: Wrong Answer)

n = int(input())
V = [int(x) for x in input().split()]
cnt1 = [0] * (100100)
cnt2 = [0] * (100100)
for i in range(n):
    if (i % 2): cnt1[V[i]] += 1
    else: cnt2[V[i]] += 1 
c1 = cnt1.index(max(cnt1))
c2 = cnt2.index(max(cnt2))    
lst1 = sorted(cnt1, reverse=True)
lst2 = sorted(cnt2, reverse=True)
i = 1
ans = 0
if (c1 == c2):
    ans += min(lst1[0], lst2[0])
while (lst1[i] != 0 or lst2[i] != 0):
    if (lst1[i] != 0): ans += lst1[i]
    if (lst2[i] != 0): ans += lst2[i]
    i += 1
print(ans)