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 math
  
  
  class xx:
      val = 0
      num = 0
  
      def __init__(self, v, n):
          self.val, self.num = v, n
  
  
  while True:
      try:
          n = eval(input().strip())
  
          arr = list(map(int, input().strip().split()))
  
          one = {}
          two = {}
          for i in range(0, n, 2):
              if arr[i] in one.keys():
                  one[arr[i]] = one[arr[i]] + 1
              else:
                  one[arr[i]] = 1
  
          for i in range(1, n, 2):
              if arr[i] in two.keys():
                  two[arr[i]] = two[arr[i]] + 1
              else:
                  two[arr[i]] = 1
  
          # print(one)
          # print(two)
          one = sorted(one.items(), key=lambda x: x[1], reverse=True)
          two = sorted(two.items(), key=lambda x: x[1], reverse=True)
          # print(one)
          # print(two)
  
          if one[0][0] != two[0][0]:
              sum = n // 2 - one[0][1]
              sum += n // 2 - two[0][1]
              print(sum)
          elif one[0][0] == two[0][0] and one[0][1] == two[0][1] and one[0][1] == n // 2:
              print(n // 2)
          elif one[0][0] == two[0][0]:
              len1 = len(one)
              len2 = len(two)
  
              if len1 >= 2 and len2 >= 2:
                  sum = n // 2 - one[0][1]
                  sum += n // 2 - two[1][1]
  
                  sum2 = n // 2 - one[1][1]
                  sum2 += n // 2 - two[0][1]
  
                  print(min(sum, sum2))
              elif len1 == 1 and len2 >= 2:
                  sum = n // 2 - one[0][1]
                  sum += n // 2 - two[1][1]
                  print(sum)
              elif len1 >= 2 and len2 == 1:
                  sum = n // 2 - one[1][1]
                  sum += n // 2 - two[0][1]
                  print(sum)
      except:
          break
  
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 /\\/\\/\\/."}]