p03244 AtCoder Beginner Contest 111 - /\/\/\/
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.

Examples

Input

4
3 1 3 2


Output

1


Input

6
105 119 105 119 105 119


Output

0


Input

4
1 1 1 1


Output

2
```python
n=int(input())
l=[int(i) for i in input().split()]
o=[[0,i] for i in range(100001)]
e=[[0,i] for i in range(100001)]
for i in range(n//2):
 o[l[i*2]][0]+=1
 e[l[i*2+1]][0]+=1
o.sort(reverse=True)
e.sort(reverse=True)
res=10000000000000000
for i in range(2):
  for j in range(2):
    if o[i][1]!=e[j][1]:
      res=min(res,n-o[i][0]-e[j][0])
print(res)
```