#include<iostream>
#include<vector>
#include<map>
#include<algorithm>
#include<set>
#include<stack>
#include<queue>
#include<string>
#include<cmath>
using namespace std;
typedef long long ll;
#define int ll
using du=double;
#define all(x) x.begin(),x.end()
//int h[4]={1,-1,0,0},z[4]={0,0,1,-1};
int n,m;
const int N=2e5+5;
const int M=1e9+7;
void solve()
{
    cin>>n;
    vector<int>a(n+2),b(n+2);
    for(int i=1;i<=n;i++)cin>>a[i]>>b[i];
    vector<vector<int>>f(n+2,vector<int>(n*m+5,1e9+7));
    f[0][0]=0;
    for(int i=1;i<=n;i++){
        for(int j=0;j<=5000000;j++){
            if(j+a[i]<=5000000){
                f[i][j+a[i]]=min(f[i][j+a[i]],max(f[i-1][j],j+a[i]));
            }
            f[i][j]=min(f[i][j],max(f[i-1][j],f[i-1][j]+b[i]));
        }
    }
    int ans =M;
    for (int j = 0;j<=5000000; j++) {
        if (f[n][j]!=M) {
            ans = min(ans,f[n][j]);
        }
    }
    cout << ans << endl;
}
signed main()
{
    ios::sync_with_stdio(false),cin.tie(nullptr),cout.tie(nullptr);
    int tt=1;//cin>>tt;
    while(tt--){
        solve();
    }
    return 0;
}