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: odds = [n * ((i + 1) % 2) for i, n in enumerate(vs)]
  evens = [n * (i % 2) for i, n in enumerate(vs)]
  
  half = int(N / 2)
  odds_half = sorted(odds)[half:]
  evens_half = sorted(evens)[half:]
  
  om_n = 0
  om_c = 0
  for n in set(odds_half):
      if odds_half.count(n) > om_c:
          om_n = n
  em_n = 0
  em_c = 0
  for n in set(evens_half):
      if evens_half.count(n) > em_c:
          em_n = n
  
  sum_odds = sum(map(lambda x: abs(x - om_n), odds_half))
  sum_evens = sum(map(lambda x: abs(x - em_n), evens_half))
  
  print(sum_odds + sum_evens)
  
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 /\\/\\/\\/."}]