#include <algorithm>
#include <iostream>

using namespace std;

const int MAXN = 10000;
const int MAXV = 20000;

int N;
int V[MAXN], T[MAXN];
pair<int, int> P[MAXN];
bool dp[MAXV + 1];

int main() {
	cin >> N;
	for (int i = 0; i < N; i++) {
		cin >> V[i] >> T[i];
		P[i] = make_pair(V[i] + T[i], i);
	}
	sort(P, P + N);
	dp[0] = true;
	int ans = 0;
	for (int i = 0; i < N; i++) {
		int j = P[i].second;
		for (int k = T[j] - 1; k >= 0; k--) {
			if (dp[k]) {
				dp[k + V[j]] = true;
				ans = max(ans, k + V[j]);
			}
		}
	}
	cout << ans << endl;
	return 0;
}