#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>

using namespace std;

const int nmax = 50;
const int amax = 1e5;

int mint[nmax + 5][(nmax + 2) * (amax + 5)];

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

	for(int i = 0; i <= nmax; i++) {
		for(int j = 0; j <= amax; j++) {
			mint[i][j] = 1e9;
		}
	}

	int n; cin >> n;
	vector<pair<int, int>> v(n); for (auto &e : v) cin >> e.first >> e.second;

	mint[0][0] = 0;

	for(int i = 1; i <= n; i++) {
		for(int j = 0; j <= n * amax; j++) {
			mint[i][j + v[i - 1].first] = min(mint[i][j + v[i - 1].first], mint[i - 1][j]);
			mint[i][j] = min(mint[i][j], mint[i - 1][j] + v[i - 1].second);
		}
	}

	int best = 1e9;
	for(int time_a = 0; time_a <= n * amax; time_a++) {
		int time_b = mint[n][time_a];
		best = min(best, max(time_a, time_b));
	}

	cout << best << endl;
}