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: a = int(input())
  b = list(map(int, input().split()))
  c = {}
  for i in range(a):
      if str(b[i]) in c:
          c[str(b[i])] += 1
      else:
          c[str(b[i])] = 1
  c = sorted(c.items(), key=lambda x: x[1], reverse=True)
  if len(c) <= 1:
      print(a // 2)
  elif len(c) == 2:
      e = [int(c[0][0]), int(c[1][0])] + b
      f = [int(c[1][0]), int(c[0][0])] + b
      ec = 0
      fc = 0
      for i in range(2, len(e)):
          if e[i] != e[i - 2]:
              e[i] = e[i - 2]
              ec += 1
          if f[i] != f[i - 2]:
              f[i] = f[i - 2]
              fc += 1
      print(min(ec, fc))
  elif len(c) >= 3:
      e = [int(c[0][0]), int(c[1][0])] + b
      f = [int(c[1][0]), int(c[0][0])] + b
      g = [int(c[0][0]), int(c[2][0])] + b
      h = [int(c[1][0]), int(c[2][0])] + b
      j = [int(c[2][0]), int(c[0][0])] + b
      k = [int(c[2][0]), int(c[1][0])] + b
  
      ec = 0
      fc = 0
      gc = 0
      hc = 0
      jc = 0
      kc = 0
      for i in range(2, len(e)):
          if e[i] != e[i - 2]:
              e[i] = e[i - 2]
              ec += 1
          if f[i] != f[i - 2]:
              f[i] = f[i - 2]
              fc += 1
          if g[i] != g[i - 2]:
              g[i] = g[i - 2]
              gc += 1
          if h[i] != h[i - 2]:
              h[i] = h[i - 2]
              hc += 1
          if j[i] != j[i - 2]:
              j[i] = j[i - 2]
              jc += 1
          if k[i] != k[i - 2]:
              k[i] = k[i - 2]
              kc += 1
      print(min(ec, fc, gc, hc, jc, kc))
  
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 /\\/\\/\\/."}]