#include<iostream>
#include<utility>
#include<algorithm>

using namespace std;

typedef pair<int,int> P;
P p[10010];
bool dp[20010] = {true};
int main(){
	int n;
	cin >> n;
	for (int i = 0; i < n; i++){
		cin >> p[i].first >> p[i].second;
	}
	sort(p, p + n);
	for (int i = 0; i < n; i++){
		for (int j = p[i].second - 1; j >= 0; j--){
			dp[j + p[i].first] |= dp[j];
		}
	}
	int res = 0;
	for (int i = 0; i < 20010; i++){
		if (dp[i])res = i;
	}
	cout << res << endl;
}