n = gets.to_i
a,b = 2.times.map{Array.new(n)}
ab = Array.new(2*n){[0,0]}
sum_a,sum_b = 0,0

n.times do |i|
  c,d = gets.split.map(&:to_i)
  a[i],b[i] = c,d
  sum_a += c
  sum_b += d
  ab[2*i,2] = [[c,i],[d,i]]
end
ab = ab.sort_by{|i,j|i}

used = Array.new(n,false)
n.times do |i|
  used[ab[i][1]] = true
end

sum_mix = 0
n.times do |i|
  sum_mix += ab[i][0]
end

if used.all?{|b|b == true}
  ans = [sum_a,sum_b].min
  n.times do |i|
    ret = sum_mix-(a[i] < b[i] ? a[i] : b[i])
    ret += ab[n][1] == i ? ab[n+1][0] : ab[n][0]
    ans = ret if ans > ret
  end
else
  ans = [sum_a,sum_b,sum_mix].min
end
p ans