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 = list(map(int, input().split()))
  
  v_odd = []
  v_even = []
  for i in range(int(n / 2)):
      v_odd.append(v[i * 2])
      v_even.append(v[i * 2 + 1])
  
  v_odd.sort()
  v_even.sort()
  
  v_odd_max_count = 0
  v_even_max_count = 0
  v_odd_max_num = 0
  v_even_max_num = 0
  
  a = 1
  for i in range(int(n / 2) - 1):
      if v_odd[i] != v_odd[i + 1]:
          if a > v_odd_max_count:
              v_odd_max_count = a
              v_odd_max_num = v_odd[i]
              a = 1
      else:
          a += 1
  if a > v_odd_max_count:
      v_odd_max_count = a
      v_odd_max_num = v_odd[i]
  a = 1
  for i in range(int(n / 2) - 1):
      if v_even[i] != v_even[i + 1]:
          if a > v_even_max_count:
              v_even_max_count = a
              v_even_max_num = v_even[i]
              a = 1
      else:
          a += 1
  if a > v_even_max_count:
      v_even_max_count = a
      v_even_max_num = v_even[i]
  
  if v_odd_max_num != v_even_max_num:
      print(n - v_odd_max_count - v_even_max_count)
  else:
      v_odd_sec_count = 0
      v_even_sec_count = 0
      v_odd = [i for i in v_odd if not i == v_odd_max_num]
      v_even = [i for i in v_even if not i == v_even_max_num]
      if not v_odd:
          v_odd_sec_count = 0
      else:
          a = 1
          for i in range(len(v_odd) - 1):
              if v_odd[i] != v_odd[i + 1]:
                  if a > v_odd_sec_count:
                      v_odd_sec_count = a
                      a = 1
              else:
                  a += 1
          if a > v_odd_sec_count:
              v_odd_sec_count = a
      if not v_even:
          v_even_sec_count = 0
      else:
          a = 1
          for i in range(len(v_even) - 1):
              if v_even[i] != v_even[i + 1]:
                  if a > v_even_sec_count:
                      v_even_sec_count = a
                      a = 1
              else:
                  a += 1
          if a > v_even_sec_count:
              v_even_sec_count = a
      if v_odd_max_count + v_even_sec_count > v_odd_sec_count + v_even_max_count:
          print(n - v_odd_max_count - v_even_sec_count)
      else:
          print(n - v_odd_sec_count - v_even_max_count)
  
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 /\\/\\/\\/."}]