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: import collections
  
  sequence_num = int(input())
  count = 0
  even_sequence_list = []
  odd_sequence_list = []
  sequence_list = list(map(int, input().split()))
  for i in range(sequence_num):
      if i % 2 == 0:
          even_sequence_list.append(sequence_list[i])
      else:
          odd_sequence_list.append(sequence_list[i])
  even_most_num = (collections.Counter(even_sequence_list)).most_common()[0][0]
  odd_most_num = (collections.Counter(odd_sequence_list)).most_common()[0][0]
  even_num_num = collections.Counter(even_sequence_list).most_common()[0][1]
  odd_num_num = collections.Counter(odd_sequence_list).most_common()[0][1]
  if even_most_num == odd_most_num:
      if even_num_num > odd_num_num:
          odd_most_num = collections.Counter(odd_sequence_list).most_common()[1][0]
      elif even_num_num < odd_num_num:
          even_most_num = collections.Counter(even_sequence_list).most_common()[1][0]
      else:
          even_most_num = 0
  """ 
  	if collections.Counter(odd_sequence_list).most_common()[0][1] == len(odd_sequence_list):
  		odd_most_num=0
  	else:
  		odd_most_num=collections.Counter(odd_sequence_list).most_common()[1][0] """
  for j in even_sequence_list:
      if j != even_most_num:
          count += 1
  for k in odd_sequence_list:
      if k != odd_most_num:
          count += 1
  print(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 /\\/\\/\\/."}]