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: # -*- coding: utf-8 -*-
  
  import math
  import sys
  import heapq
  from operator import itemgetter
  import itertools
  
  input = sys.stdin.readline
  
  # a = int(input().rstrip())
  # a, b = map(int, input().rstrip().split())
  # D = list(map(int, input().rstrip().split()))
  # H = [int(input().rstrip()) for _ in range(L)]
  # DD = [[0 for j in range(100)] for i in range(200)]
  # dict = {} ## dictionary
  
  # a = sorted(a, key=lambda x: x[1]))
  # if __name__ == '__main__':
  
  n = int(input().rstrip())
  v = list(map(int, input().rstrip().split()))
  v_even = dict()
  v_odd = dict()
  
  
  def solve(d1, d2):
      d1_max = [[0, 0], [0, 0]]
      d2_max = [[0, 0], [0, 0]]
      for i in d1:
          if d1_max[0][1] <= d1[i]:
              d1_max[1] = d1_max[0]
              d1_max[0] = [i, d1[i]]
      for i in d2:
          if d2_max[0][1] <= d2[i]:
              d2_max[1] = d2_max[0]
              d2_max[0] = [i, d2[i]]
  
      print(d1_max)
      print(d2_max)
  
      if d1_max[0][0] != d2_max[0][0]:
          return n - d1_max[0][1] - d2_max[0][1]
      else:
          return min(n - d1_max[1][1] - d2_max[0][1], n - d1_max[0][1] - d2_max[1][1])
  
  
  for i in range(len(v)):
      if i % 2 == 0:
          if v[i] not in v_even:
              v_even[v[i]] = 1
          else:
              v_even[v[i]] += 1
      else:
          if v[i] not in v_odd:
              v_odd[v[i]] = 1
          else:
              v_odd[v[i]] += 1
  
  print(solve(v_even, v_odd))
  
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 /\\/\\/\\/."}]