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: n = input()
  
  v = input()
  v = v.split(" ")
  v = [int(i) for i in v]
  
  
  odd_v = v[::2]
  even_v = v[1::2]
  
  counter_odd = {}
  
  for i in odd_v:
      if not i in counter_odd:
          counter_odd[i] = 1
      else:
          counter_odd[i] += 1
  
  counter_even = {}
  for i in even_v:
      if not i in counter_even:
          counter_even[i] = 1
      else:
          counter_even[i] += 1
  
  
  max_odd = -1e100
  max_odd_idx = 0
  for k, v in counter_odd.items():
      if max(v, max_odd) == v:
          max_odd = v
          max_odd_idx = k
  
  
  max_even = -1e100
  max_even_idx = 0
  for k, v in counter_even.items():
      if max(v, max_even) == v:
          max_even = v
          max_even_idx = k
  
  should_change_odd = None
  
  if max_odd_idx == max_even_idx:
      if max_odd <= max_even:
          should_change_odd = True
      else:
          should_change_odd = False
  
  nb_change = 0
  m = int(n) / 2
  
  if should_change_odd is None:
      nb_change += m - max_odd
      nb_change += m - max_even
  elif should_change_odd is True:
      # 2nd largest item
      if len(counter_odd.items()) == 1:
          nb_change += m
      else:
          s = sorted(counter_odd.items(), key=lambda x: x[1])[0][1]
          nb_change += m - s
          nb_change += m - max_even
  elif should_change_odd is False:
      # 2nd largest item
      if len(counter_even.items()) == 1:
          nb_change += m
      else:
          s = sorted(counter_even.items(), key=lambda x: x[1])[0][1]
          nb_change += m - s
          nb_change += m - max_odd
  
  print(int(nb_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 /\\/\\/\\/."}]