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
  n = int(input())
  v = list(map(int, input().split()))
  
  count = 0
  v1 = []
  v2 = []
  while count < n:
    v1.append(v[count])
    v2.append(v[count + 1])
    count += 2
  
  c1 = collections.Counter(v1)
  c2 = collections.Counter(v2)
  
  num1, count1 = c1.most_common()[0]
  num2, count2 = c2.most_common()[0]
  
  if num1 != num2:
    min_count = (n // 2 - count1) + (n // 2 - count2)
  elif count1 == count2 and count1 == n // 2:
    min_count = (n // 2)
  else:
    if count1 == count2:
      for i in range(min(len(c1.most_common()), c2.most_common())):
          a = i + 1
          if c1.most_common()[a][a] == c2.most_common()[a][a]:
              continue
          if c1.most_common()[a][a] > c2.most_common()[a][a]:
              num2, count2 = c2.most_common()[a]
              break
          else:
              num1, count1 = c1.most_common()[a]
              break
      min_count = (n // 2 - count1) + (n // 2 - count2)
    else:
      if len(c1.most_common()) > 1 and len(c2.most_common())
        num3, count3 = c1.most_common()[1]
        num4, count4 = c2.most_common()[1]
        a = (n // 2 - count1) + (n // 2 -count4)
        b = (n // 2 - count2) + (n // 2 -count3)
        min_count = min(a,b)
      else:
        if count1 > count2:
          num2, count2 = c2.most_common()[1]
          min_count = (n // 2 - count1) + (n // 2 - count2)
        else:
          num1, count1 = c1.most_common()[1]
          min_count = (n // 2 - count2) + (n // 2 - count1)
  print(min_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 /\\/\\/\\/."}]