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: iipt = lambda: int(input())
  miipt = lambda: map(int, input().split(" "))
  o = [0] * 112345
  e = [0] * 112345
  n = iipt()
  A = miipt()
  for i, a in enumerate(A):
      if i % 2:
          o[a] += 1
      else:
          e[a] += 1
  om = -1, 0
  om2 = -1, 0
  em = -1, 0
  em2 = -1, 0
  for i, v in enumerate(o):
      if v >= om[1]:
          om2 = om
          om = i, v
      elif v >= om2[1]:
          om2 = i, v
  for i, v in enumerate(e):
      if v >= em[1]:
          em2 = em
          em = i, v
      elif v >= em2[1]:
          em2 = i, v
  if om[0] == em[0]:
      print(min(n - om2[1] - em[1], n - om[1] - em2[1]))
  else:
      print(n - om[1] - em[1])
  
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 /\\/\\/\\/."}]