#include "bits/stdc++.h"

using namespace std;

using ll = long long;
using ld = long double;

const double PI = 3.1415926535897932384626433832795;

const int dx[] = { 0, 1, 0, -1 };
const int dy[] = { -1, 0, 1, 0 };

int gcd(int x, int y) { return y ? gcd(y, x % y) : x; }
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
int lcm(int x, int y) { return x / gcd(x, y) * y; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }

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

	int n;
	cin >> n;

	vector<int> a(n), b(n);
	for (int i = 0; i < n; i++) {
		cin >> a[i] >> b[i];
	}

	int greedy = [&]() -> int {
		int aCost = 0, bCost = 0;
		for (int i = 0; i < n; i++) {
			if (a[i] < b[i]) {
				aCost += a[i];
			} else {
				bCost += b[i];
			}
		}
		return max(aCost, bCost);
	}();

	vector<int> dp(greedy);
	for (int i = 0; i < n; i++) {
		for (int j = greedy - a[i] - 1; j >= 0; j--) {
			dp[j + a[i]] = max(dp[j + a[i]], dp[j] + b[i]);
		}
	}

	int ans = greedy;
	int bSum = accumulate(begin(b), end(b), 0);
	for (int i = 0; i < greedy; i++) {
		ans = min(ans, max(i, bSum - dp[i]));
	}

	cout << ans << endl;
	return 0;
}