#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <limits>
#include <climits>
#include <cfloat>
#include <functional>
using namespace std;

int main()
{
    int n;
    cin >> n;
    vector<pair<int, int> > v(n);
    for(int i=0; i<n; ++i)
        cin >> v[i].first >> v[i].second;
    sort(v.begin(), v.end(), [](const pair<int, int>& x, const pair<int, int>& y){ return x.first + x.second < y.first + y.second; });

    vector<bool> dp(10000, false);
    dp[0] = true;
    int ret = 0;
    for(int i=0; i<n; ++i){
        for(int j=v[i].second-1; j>=0; --j){
            if(!dp[j])
                continue;

            int k = j + v[i].first;
            ret = max(ret, k);
            if(k < 10000)
                dp[k] = true;
        }
    }
    cout << ret << endl;

    return 0;
}