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: n = int(input())
  v = list(map(int, input().split()))
  a = sorted(([i,v[::2].count(i)] for i in set(v[::2])), key=lambda x:x[1])
  b = sorted(([j,v[1::2].count(j)] for j in set(v[1::2])),key=lambda x:x[1])
  if a[-1]!=b[-1]:
      print(n-a[-1][1]-b[-1][1])
  elif len(a) == 1 and len(b) == 1:
      print(min(a[-1][1],b[-1][1]))
  elif len(a) ==1:
      print(n-a[-1][1]-b[-2][1])
  elif len(b) ==1:
      print(n-a[-2][1]-b[-1][1])
  else:
      print(min(n-a[-2][1]-b[-1][1],n-a[-1][1]-b[-2][1])
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 /\\/\\/\\/."}]