#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
#define rep(i, n) REP(i, 0, n)
#define REP(i, s, e) for (int i = (s); i < (int)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for (int i = (int)(s - 1); i >= (int)(e); i--)
#define all(r) r.begin(), r.end()
#define rall(r) r.rbegin(), r.rend()

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;

template <typename T, typename U>
T chmax(T& a, const U& b) {
    if (a >= b) return false;
    a = b;
    return true;
}
template <typename T, typename U>
T chmin(T& a, const U& b) {
    if (a <= b) return false;
    a = b;
    return true;
}

void yes_no(bool f, string yes = "Yes", string no = "No") { cout << (f ? yes : no) << "\n"; }

unsigned int randxor() {
    static unsigned int x = 123456789, y = 362436069, z = 521288629, w = 88675123;
    unsigned int t;
    t = (x ^ (x << 11));
    x = y;
    y = z;
    z = w;
    return (w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)));
}

void solve() {
    int n;
    cin >> n;
    vl v(n), t(n);
    rep(i, n) cin >> v[i] >> t[i];
    vi idx(n);
    rep(i, n) idx[i] = i;
    sort(all(idx), [&](int idx_i, int idx_j) {
        return v[idx_i] + t[idx_i] < v[idx_j] + t[idx_j];
    });
    const int ma = (int)2e4 + 10;
    vector dp(ma, 0);
    dp[0] = 1;
    for (auto&& i : idx) {
        vector nxt = dp;
        rep(j, t[i]) nxt[j + v[i]] |= dp[j];
        swap(nxt, dp);
    }
    int ans = 0;
    rep(i, ma) if (dp[i]) ans = i;
    cout << ans << "\n";
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int t = 1;
    // cin >> t;
    rep(ti, t) solve();
    return 0;
}