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 = int(input())
  v = [{}, {}]
  for i, vi in enumerate(map(int, input().split())):
      j = i % 2
      v[j].update([(vi, v[j][vi] + 1)]) if vi in v[j] else v[j].update([(vi, 1)])
  f1 = lambda v, i: max(v[i], key=v[i].get) if len(v[i]) > 0 else 0
  f2 = lambda v, i, k: v[i].pop(k) if len(v[i]) > 0 else 0
  kMax, vMax = [], []
  for i in [0, 1]:
      kMax.append([f1(v, 0), f1(v, 1)])
      vMax.append([f2(v, 0, kMax[i][0]), f2(v, 1, kMax[i][1])])
  if kMax[0][0] != kMax[0][1]:
      print(n - sum(vMax[0]))
  else:
      print(n - max([vMax[0][0] + vMax[1][1], vMax[0][1] + vMax[1][0]]))
  
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 /\\/\\/\\/."}]