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: n1 = int(input())
  
  n2 = [int(i) for i in input().split()]
  
  n3 = []
  n4 = []
  for i1 in range(n1):
      if i1 % 2 == 0:
          n3.append(n2[i1])
      else:
          n4.append(n2[i1])
  
  n3.sort()
  n4.sort()
  
  t1 = 0
  c1 = 0
  n5 = []
  
  for i2 in range(len(n3)):
      if n3[i2] == t1:
          c1 += 1
          if i2 == len(n3) - 1:
              n5.append([t1, c1])
      else:
          if i2 != 0:
              n5.append([t1, c1])
          t1 = n3[i2]
          c1 = 1
          if i2 == len(n3) - 1:
              n5.append([t1, c1])
  
  t1 = 0
  c1 = 0
  n6 = []
  for i3 in range(len(n4)):
      if n4[i3] == t1:
          c1 += 1
          if i3 == len(n4) - 1:
              n6.append([t1, c1])
      else:
          if i3 != 0:
              n6.append([t1, c1])
          t1 = n4[i3]
          c1 = 1
          if i3 == len(n4) - 1:
              n6.append([t1, c1])
  
  n5.sort(key=lambda x: (x[1], x[0]), reverse=True)
  n6.sort(key=lambda x: (x[1], x[0]), reverse=True)
  
  r1 = 0
  
  if len(n5) == 1 and len(n6) == 1 and n5[0][0] == n6[0][0]:
      r1 = n1 // 2
  else:
      if n5[0][0] != n6[0][0]:
          r1 = n1 - n5[0][1] - n6[0][1]
      else:
          if len(n5) == 1:
              r1 = n1 - n5[0][1] - n6[1][1]
          elif len(n6) == 1:
              r1 = n1 - n5[1][1] - n6[0][1]
          else:
              if (n1 - n5[0][1] - n6[1][1]) >= (n1 - n5[1][1] - n6[0][1]):
                  r1 = r1 = n1 - n5[1][1] - n6[0][1]
              else:
                  r1 = n1 - n5[0][1] - n6[1][1]
  
  print(r1)
  
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 /\\/\\/\\/."}]