#include<bits/stdc++.h>

using namespace std;

const int MAX = 5e6 + 5;

int f[2][MAX];

int main() {
    int n;
    cin >> n;
    vector<int> a(n), b(n);
    int tot = 0;
    for (int i = 0; i < n; i++) {
        cin >> a[i] >> b[i];
    }
    memset(f, 0x3f, sizeof(f));
    f[1][0] = 0;
    for (int i = 0; i < n; i++) {
        memset(f[i & 1], 0x3f, sizeof(f[i & 1]));
        for (int j = 0; j <= tot; j++) {
            f[i & 1][j] = min(f[~i & 1][j] + b[i], f[i & 1][j]);
            f[i & 1][j + a[i]] = min(f[~i & 1][j], f[i & 1][j + a[i]]);
        }         
        tot += a[i];
    }
    int ans = 1e9;
    for (int i = 0; i < tot; i++) {
        ans = min(ans, max(i, f[~n & 1][i]));
    }
    cout << ans << '\n';
}