#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;
using ll = long long;

#include<set>
#include<bitset>
using B = bitset<20002>;
int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    int n;
    cin>>n;
    vector<ll> v(n),t(n);
    for(int i = 0;i<n;i++) cin>>v[i]>>t[i];
    ll sum = 0;
    for(int i = 0;i<n;i++) sum += v[i];
    const int mx = 20001;
    ll right = 20001;
    ll left = 0;

    vector<int> idx(n);
    for(int i = 0;i<n;i++) idx[i] = i;
    sort(idx.begin(),idx.end(),[&](int i,int j){
        return t[i] + v[i] - 1 > t[j] + v[j] - 1;
    });

    auto calc = [&](ll now) {
        B dp;
        for(int i = now;i<=mx;i++) dp.set(i);
        int ok = mx;
        B mask;
        for(int i = 0;i<=mx;i++) mask.set(i);
        for(int i = 0;i<n;i++){
            int ni = idx[i];
            B ndp = dp;
            for(int j = ok;j>t[ni]+v[ni]-1;j--) mask.reset(j);
            ok = min<int>(ok,t[ni]+v[ni]-1);
            ndp |= (dp&mask) >> v[ni];
            swap(dp,ndp);
        }
        return dp[0];
    };

    while(right-left>1){
        ll mid = (right+left) / 2;
        if(calc(mid)) left = mid;
        else right = mid;
    }
    cout<<left<<endl;
}