#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

int main() {
    int n; cin >> n;
    vector<pair<int,P>> v(n);
    rep(i,n){
        cin >> v[i].second.first >> v[i].second.second;
        v[i].first = v[i].second.first + v[i].second.second;
    }
    sort(v.begin(), v.end());

    ll dp[30000] = {};
    dp[0] = 1;

    rep(i,n){
        int t = v[i].second.second;
        int x = v[i].second.first;
        drep(j,t){
            if(dp[j]) dp[j+x] = 1;
        }
    }
    int ans = 0;
    rep(i,30000) if(dp[i]) ans = i;
    cout << ans << endl;
    return 0;
}