#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define array2(type, x, y) array<array<type, y>, x>
#define vector2(type) vector<vector<type> >
#define out(...) printf(__VA_ARGS__)

int dxy[] = {0, 1, 0, -1, 0};

void solve();
signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}

/*================================*/

int N,M,Q;
int A[111], B[111];
// 問目*経過時間 = Aが減らせる時間
int DP[111][1111111];

void solve() {
    cin>>N;
    REP(i, N) cin>>A[i]>>B[i];
    
    int sumA=0, sumB=0;
    REP(i,N) {
        sumA+=A[i];
        sumB+=B[i];
    }
    REP(i,N)REP(j,sumB+1) DP[i][j]=-1;
    
    DP[0][0] = 0;
    DP[0][B[0]] = A[0];
    FOR(i,1,N) REP(j,sumB+1){
        if (DP[i-1][j]>-1) {
            DP[i][j] = max(DP[i][j], DP[i-1][j]);
            DP[i][j+B[i]] = max(DP[i][j+B[i]], DP[i-1][j]+A[i]);
        }
    }
    int ans = LONG_LONG_MAX;
    REP(j,sumB+1) {
        ans = min(ans, max(j, sumA - DP[N-1][j]));
    }
    
    cout << ans << endl;
}