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()))
  
  
  def calc(l):
      new_l = []
      adic = {}
      count = 0
      for c in l:
          if c in adic.keys():
              new_l.append(adic[c])
          else:
              new_l.append(count)
              adic[c] = count
              count += 1
      return new_l
  
  
  def mink(lis):
      # print(lis)
      l = lis[0::2]
      m = lis[1::2]
  
      ls = [[i, 0] for i in (set(l))]
      for d in l:
          for f in ls:
              if d == f[0]:
                  f[1] += 1
      nls = sorted(ls, key=lambda x: x[1])
      ms = [[i, 0] for i in (set(m))]
      for e in m:
          for g in ms:
              if e == g[0]:
                  g[1] += 1
      nms = sorted(ms, key=lambda x: x[1])
  
      if len(nls) > 1:
          sfls = nls[1][1]
      else:
          sfls = -1
      if len(nms) > 1:
          sfms = nms[1][1]
      else:
          sfms = -1
  
      ll = len(l) - nls[0][1]
      mm = len(m) - nms[0][1]
      if nls[0][0] == nms[0][0]:
          if nls[0][1] > nms[0][1]:
              if len(nms) > 1:
                  mm = len(m) - nms[1][1]
              else:
                  mm = len(m)
          elif nls[0][1] < nms[0][1]:
              if len(nls) > 1:
                  ll = len(l) - nls[1][1]
              else:
                  ll = len(l)
          else:  # ==
              mm = len(m) - max(sfls, sfms)
              if mm > len(m):
                  mm = len(m)
      print(ll + mm)
  
  
  mink(calc(v))
  
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 /\\/\\/\\/."}]