#include <bits/stdc++.h>
using namespace std;

#define endl '\n'
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define uniq(v) (v).erase(unique((v).begin(), (v).end()), (v).end())

typedef long long ll;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
typedef unsigned int uint;
typedef unsigned long long ull;
struct pairhash {
public:
    template<typename T, typename U>
    size_t operator()(const pair<T, U> &x) const {
	size_t seed = hash<T>()(x.first);
	return hash<U>()(x.second) + 0x9e3779b9 + (seed<<6) + (seed>>2);
    }
};

const int inf = 1000000009;
const double eps = 1e-8;

vector<T> vt;
int memo[10001][10001];

int calc(int sum, int num, int n) {
    int v = get<1>(vt[num]), t = get<2>(vt[num]);
    if (num == n-1) {
	return sum + (t > sum ? v : 0);
    } else {
	if (sum > 10000) return sum;
	if (memo[sum][num] < 0) {
	    int res = 0;
	    if (t > sum) {
		res = calc(sum+v, num+1, n);
	    }
	    memo[sum][num] = max(res, calc(sum, num+1, n));	    
	}
	return memo[sum][num];
    }
}

int solve(int n) {
    for (int i = 0; i < n; i++) {
	int v, t;
	scanf("%d%d", &v, &t);
	vt.push_back(make_tuple(v+t, v, t));
    }
    sort(all(vt));
    memset(memo, -1, sizeof(memo));
    return calc(0, 0, n);
}

int main() {
    /*
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(15);
    */

    int n;
    scanf("%d", &n);
    printf("%d\n", solve(n));
}