#include <bits/stdc++.h>
using namespace std;

#define rep(i,n) for(int i=0;i<n;++i)
#define rrep(i,n) for(int i=n-1;i>=0;i--)

int solve(const int n, const vector<int> &A, const vector<int> &B) {
	int sum_b = accumulate(B.begin(), B.end(), 0);

	int ma;
	{
		int aa = 0, bb = 0;
		rep(i, n) {
			if (A[i] < B[i]) aa += A[i];
			else bb += B[i];
		}
		ma = max(aa, bb);
	}

	vector<int> dp(ma);
	dp[0] = 0;

	rep(i, n) {
		rrep(j, ma - A[i]) {
			dp[j + A[i]] = max(dp[j + A[i]], dp[j] + B[i]);
		}
	}

	int ans = ma;
	rep(i, ma) {
		ans = min(ans, max(i, sum_b - dp[i]));
	}

	return ans;
}

int main() {
	cin.tie(nullptr);
	ios::sync_with_stdio(false);

	int n;
	cin >> n;

	vector<int> A(n), B(n);
	rep(i, n) {
		cin >> A[i] >> B[i];
	}

	int ans = solve(n, A, B);

	cout << ans << endl;

	return 0;
}