#include "bits/stdc++.h"
#include<unordered_map>
#pragma warning(disable:4996)
using namespace std;
using ld = long double;
template<class T>
using Table = vector<vector<T>>;


int main() {
	int N; cin >> N;
	vector<pair<int, int>>houses(N);
	for (int i = 0; i < N; ++i){
		int a, b; cin >> a >> b;
		houses[i] = make_pair(b,a);
	}
	sort(houses.begin(), houses.end(), [](const pair<int, int>&l, const pair<int, int>&r){return l.first+l.second < r.first+r.second; });
	vector<bool>oks(20001, false);
	oks[0] = true;
	for (int i = 0; i < N; ++i){
		for (int j = houses[i].first-1; j >= 0; --j){
			if(oks[j])oks[j + houses[i].second] = true;
		}
	}
	for (int i = 20000;i >= 0; --i){
		if (oks[i]){
			cout << i << endl;
			return 0;
		}
	}
	return 0;
}