output_description: Print the minimum number of elements that needs to be replaced.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      n
      v_1 v_2 ... v_n
attempt: _ = input()
  seq = list(map(int,input().split()))
   
  seq1 = seq[::2]
  seq2 = seq[1::2]
   
  if len(set(seq)) == 1:
      print(min(len(seq1),len(seq2)))
      exit()
      
  def count_dictonary(seq):
      ret_dict={}
      for item in seq:
          if item not in ret_dict:
              ret_dict[item] = 1
          else:
              ret_dict[item]+=1
      return ret_dict
   '''
  seq_dict1 = count_dictonary(seq1)
  seq_dict2 = count_dictonary(seq2)
   
  min_change=len(seq)
  for i1 in seq_dict1:
      for i2 in seq_dict2:
          ch1 = len(seq1) - seq_dict1[i1]
          ch2 = len(seq2) - seq_dict2[i2]
          #print(i1,i2,ch1,ch2,ch1+ch2)
          change_ = ch1+ch2
          if(min_change > ch1+ch2):
              min_change = ch1+ch2
              
  print(min_change)
  '''
problem_description: 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.
samples: [{"input": "4\n    3 1 3 2", "output": "1\n    \n\nThe sequence 3,1,3,2 is not /\\/\\/\\/, but we can make it /\\/\\/\\/ by replacing\none of its elements: for example, replace the fourth element to make it\n3,1,3,1.\n\n* * *"}, {"input": "6\n    105 119 105 119 105 119", "output": "0\n    \n\nThe sequence 105,119,105,119,105,119 is /\\/\\/\\/.\n\n* * *"}, {"input": "4\n    1 1 1 1", "output": "2\n    \n\nThe elements of the sequence 1,1,1,1 are all the same, so it is not /\\/\\/\\/."}]