#!/usr/bin/env ruby

require 'set'

class Hash
  def push(key, value)
    self[key] = [] if self[key] == nil
    self[key].push(value)
  end
end

class Array
  def lower_bound(value)
    left = -1;
    right = self.length;
    while left + 1 < right
      mid = left + (right - left) / 2;
      if self[mid] >= value
        right = mid
      else
        left = mid
      end
    end
    right
  end

  def unique
    res = [self.first]
    each_cons(2) do |a, b|
      if a != b
        res.push(b)
      end
    end
    res
  end
end

def get_ints
  gets.chomp.split.map(&:to_i)
end

def get_ints_minus_one
  get_ints.map { |x| x - 1 }
end

def get_int
  gets.chomp.to_i
end

N = get_int
V = get_ints

odds = V.filter.with_index { |v, i| i % 2 == 1 }
evens = V.filter.with_index { |v, i| i % 2 == 0 }

ans = 0

odds_hash = Hash.new { |h, k| h[k] = 0 }

odds.each do |n|
  odds_hash[n] += 1
end

odds_sorted_hash = odds_hash.sort { |a, b| a[1] <=> b[1] }

events_hash = Hash.new { |h, k| h[k] = 0 }

evens.each do |n|
  events_hash[n] += 1
end

evens_sorted_hash = events_hash.sort { |a, b| a[1] <=> b[1] }

odd_ans = odds_sorted_hash.pop
even_ans = evens_sorted_hash.pop

if odd_ans[0] == even_ans[0]
  o = odds_sorted_hash.pop
  e = evens_sorted_hash.pop

  if o.nil?
    even_ans = [0, 0]
  elsif o[1] > e[1]
    odd_ans = o
  else
    even_ans = e
  end
end

puts odds.length - odd_ans[1] + evens.length - even_ans[1]
