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: from collections import defaultdict
  
  n = int(input())
  li_input = list(map(int, input().split()))
  
  li_ki = li_input[0::2]
  d_ki = defaultdict(int)
  for ki in li_ki:
      d_ki[ki] += 1
  
  
  li_gu = li_input[1::2]
  d_gu = defaultdict(int)
  for gu in li_gu:
      d_gu[gu] += 1
  
  ki_sort = sorted([(k, v) for k, v in d_ki.items()], key=lambda x: x[1], reverse=True)
  gu_sort = sorted([(k, v) for k, v in d_gu.items()], key=lambda x: x[1], reverse=True)
  
  ki_cnt = 0
  gu_cnt = 0
  
  if ki_sort[0][1] >= gu_sort[0][1]:
      ki_cnt = ki_sort[0][1]
      for g in gu_sort:
          if ki_sort[0][0] != g[0]:
              gu_cnt = g[1]
              break
  else:
      gu_cnt = gu_sort[0][1]
      for k in ki_sort:
          if gu_sort[0][0] != k[0]:
              ki_cnt = k[1]
              break
  
  print(n - ki_cnt - gu_cnt)
  
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 /\\/\\/\\/."}]