#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = (ll)(1e+9) + 7;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef long double ld;
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;
typedef pair<ld, ld> LDP;
bool comp(P x, P y) {
	int xc = x.first + x.second;
	int yc = y.first + y.second;
	return xc < yc;
}
P c[1 << 15];
bitset<(1 << 15)> dp;
int main() {
	int n; cin >> n;
	rep(i, n) {
		int v, t; cin >> v >> t;
		c[i] = { v,t };
	}
	sort(c, c + n, comp);
	dp[0] = 1;
	rep(i, n) {
		per(j, 10001) {
			if (j < c[i].second&&dp[j]) {
				dp[j + c[i].first] = 1;
			}
		}
	}
	int out = 0;
	rep(i, (1 << 15)) {
		if (dp[i])out = i;
	}
	cout << out << endl;
	return 0;
}