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 statistics import mode
  from collections import Counter
  
  # S = input()
  n = int(input())
  # N, K = map(int, input().split())
  v = list(map(int, input().split()))
  # LR = [list(map(int, input().split())) for _ in range(M)]
  
  guu = []
  kii = []
  
  for i in range(n):
      if (i % 2) == 0:
          guu.append(v[i])
      else:
          kii.append(v[i])
  
  counterK = Counter(guu)
  guuMaxCount = counterK.most_common()[0][1]
  
  counterG = Counter(kii)
  kiiMaxCount = counterG.most_common()[0][1]
  
  if counterK.most_common()[0][0] == counterG.most_common()[0][0]:
      if n == 2:
          kiiMaxCount = 0
      elif n == 3:
          kiiMaxCount = 0
      elif n >= 4:
          if len(counterK.most_common()) >= 2 and len(counterG.most_common()) >= 2:
              if (
                  kiiMaxCount - counterK.most_common()[1][1]
                  >= guuMaxCount - counterG.most_common()[1][1]
              ):
                  guuMaxCount = counterG.most_common()[1][1]
              else:
                  kiiMaxCount = counterK.most_common()[1][1]
          elif len(counterK.most_common()) >= 2 and len(counterG.most_common()) == 1:
              kiiMaxCount = kiiMaxCount = counterK.most_common()[1][1]
          elif len(counterK.most_common()) == 1 and len(counterG.most_common()) >= 2:
              guuMaxCount = counterG.most_common()[1][1]
          else:
              kiiMaxCount = 0
  
  ans = n
  
  
  print(ans - guuMaxCount - kiiMaxCount)
  
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 /\\/\\/\\/."}]