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 Java8 (OpenJDK 1.8.0) (judge verdict: Runtime Error)



import java.util.*;

class Main {
  public static void main (String[] args) {
    
    Scanner scan = new Scanner(System.in);
    
    int n = scan.nextInt();
    
    int odd[] = new int[100000];
    int even[] = new int[100000];

    
    
    for (int i=0; i<n/2;i++){
      odd[scan.nextInt()]++;
      even[scan.nextInt()]++;
      }
    
    int omc=0;
    int omc2=0;
    int om =0;
    
    int emc=0;
    int emc2=0;
    int em =0;
      
     
    for (int i=1; i<100001; i++){
        if(odd[i]==0)continue;
        if(odd[i]>omc){
             omc2=omc;
             omc=odd[i];
             om=i;
        }
     }
    
    for (int i=1; i<100001; i++){
        if(even[i]==0)continue;
        if(even[i]>emc){
             emc2=emc;
             emc=even[i];
             em=i;
        }
     }
    
    int oans=n/2-omc;
    int eans=n/2-emc;
    
    int ans=0;
    
    if(om==em){
    	if(n/2-omc==0 && n/2-emc==0){
    		ans=n/2;
    	}else{
    		ans = Math.min(n-omc-emc2, n-omc2-emc);
    	}
    }else{
    	ans = n/2-omc-emc;
    }
   

      System.out.println(ans);
  }
 
}