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: import copy
  
  n = int(input())
  li = input().split(" ")
  el = []
  ol = []
  for i in range(n):
      if i % 2 == 0:
          el.append(int(li[i]))
      else:
          ol.append(int(li[i]))
  n_el = len(list(set(el)))
  n_ol = len(list(set(ol)))
  if n_el == 1 and n_ol == 1 and el[0] != ol[0]:
      print(0)
  elif n_el == 1 and n_ol == 1 and el[0] == ol[0]:
      print(len(ol))
  else:
      els = {}
      ols = {}
      for e in el:
          if str(e) in els:
              els[str(e)] += 1
          else:
              els[str(e)] = 1
      for o in ol:
          if str(o) in ols:
              ols[str(o)] += 1
          else:
              ols[str(o)] = 1
      # print(els)
      # print(ols)
  
      elv = list(els.values())
      olv = list(ols.values())
      elk = sorted(list(els.keys()))
      olk = sorted(list(ols.keys()))
      # print(elv)
      # print(olv)
  
      is_same_key = 1
      for i in range(len(elk)):
          if elk[i] != olk[i]:
              is_same_key = 0
              break
      ans = 0
      if not (is_same_key):
          ans += sum(elv) - max(elv)
          ans += sum(olv) - max(olv)
          print(ans)
      else:
          tempe = []
          tempo = []
          for i in elk:
              tempe.append(n // 2 - els[i])
              tempo.append(n // 2 - ols[i])
          # print(tempe)
          # print(tempo)
          min_e = min(tempe)
          min_o = min(tempo)
          ind_min_e = tempe.index(min_e)
          ind_min_o = tempo.index(min_o)
          if ind_min_o != ind_min_e:
              print(min_e + min_o)
          else:
              ans_temp = 0
              tempo_temp = copy.deepcopy(tempo)
              tempe_temp = copy.deepcopy(tempe)
              tempo_temp[ind_min_o] = 999999999
              ans_temp = min_e + min(tempo_temp)
              tempe_temp[ind_min_e] = 999999999
              if min_o + min(tempe_temp) < ans_temp:
                  ans_temp = min_o + min(tempe_temp)
              print(ans_temp)
  
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 /\\/\\/\\/."}]