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: ai = lambda: list(map(int,input().split()))
  ai_ = lambda: [int(x)-1 for x in input().split()]
  
  n = int(input())
  a = ai()
  if all(i == a[0] for i in a):
      print(n//2)
      exit()
  
  a1 = a[::2]
  a2 = a[1::2]
  
  from collections import Counter
  c1 = Counter(a1)
  c2 = Counter(a2)
  m1 = c1.most_common(2)
  m2 = c2.most_common(2)
  if m1[0][0] == m2[0][0]:
      if len(c1) == 1:
          print(n-m1[0][1]-m2[1][1])
      elif len(c2) == 1:
          print(n - m1[0][1] - m2[1][1])
      else:
          print(min(n-m1[0][1]-m2[1][1], n-m1[1][1]-m2[0][1]))
  else:
      print(n-m1[0
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 /\\/\\/\\/."}]