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()
  x = list(map(int, input().split(" ")))
  
  ki = []
  gu = []
  
  ki = x[0::2]
  gu = x[1::2]
  
  a = set(ki)
  
  dd = 0
  z = ki.count(a[0])
  b = [0, z]
  for i in range(1, len(a)):
      c = ki.count(a[i])
      b.append(c)
      if z < c:
          dd = i
  
  a2 = set(gu)
  
  bb = 0
  y = gu.count(gu[0])
  d = [0, y]
  for i in range(1, len(a2)):
      c = gu.count(a2[i])
      d.append(c)
      if y < c:
          bb = i
  
  if a[dd] != a2[bb]:
      print(len(ki) - max(b) + len(gu) - max(d))
  else:
      if max(a) > max(a2):
          d = sorted(d, reverse=True)
          print(len(ki) - max(b) + len(gu) - d[1])
      else:
          b = sorted(b, reverse=True)
          print(len(ki) - b[1] + len(gu) - max(d))
  
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 /\\/\\/\\/."}]