Contest Duration: ~ (local time) (100 minutes) Back to Home
C - /\/\/\/ /

Time Limit: 2 sec / Memory Limit: 1024 MB

### 問題文

• i = 1,2,..., n-2 について、a_i = a_{i+2}
• 数列に現れる数はちょうど 2 種類

### 制約

• 2 \leq n \leq 10^5
• n は偶数
• 1 \leq v_i \leq 10^5
• v_i は整数

### 入力

n
v_1 v_2 ... v_n


### 入力例 1

4
3 1 3 2


### 出力例 1

1


### 入力例 2

6
105 119 105 119 105 119


### 出力例 2

0


### 入力例 3

4
1 1 1 1


### 出力例 3

2


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 /\/\/\/.