N = gets.to_i
A = []
B = []

sum_b = 0
N.times do
	a, b = gets.split.map(&:to_i)
	A.push(a)
	B.push(b)
	sum_b += b
end

aa = 0
bb = 0

N.times do |i|
	if aa < bb
		aa += A[i]
	else
		bb += B[i]
	end
end

ma = [aa, bb].max

dp = [0] * ma

N.times do |i|
	a = A[i]
	b = B[i]
	(ma-a-1).downto(0) do |j|
		dp[j + a] = [dp[j + a], dp[j] + b].max
	end
end

ans = ma
ma.times do |i|
	ans = [ans, [i, sum_b - dp[i]].max].min
end

puts(ans.to_s)