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 <= 10**5
  n = int(input())
  # vi <= 10**5
  v = list(map(int, input().split()))
  a = [[0, 0] for _ in range(100010)]
  for i in range(n):
      a[i % 2][v[i]] += 1
  
  od, ev = [], []
  for i in range(100010):
      od.append([a[1][i], i])
      ev.append([a[0][i], i])
  od.sort()
  od.reverse()
  ev.sort()
  ev.reverse()
  if od[0][1] != ev[0][1]: print(n - od[0][0] - ev[0][0])
  else: print(n - max(od[0][0] + ev[[0][1], od[1][0] + ev[0][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 /\\/\\/\\/."}]