#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
const int N = 2e5 + 5;
const int M = 1e9 + 7;
void solve() {
    int n;
    cin >> n;
    vector<int> a(n + 1), b(n + 1);
    int max_state = 0;
    for (int i = 1; i <= n; i++) {
        cin >> a[i] >> b[i];
        max_state += a[i];
    }
    vector<vector<int>> f(n + 1, vector<int>(max_state + 1, M));
    f[0][0] = 0;
    for (int i = 1; i <= n; i++) {
        for (int j = 0; j <= max_state; j++) {
            if (j + a[i] <= max_state) {
                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 <= max_state; j++) {
        if (f[n][j] != M) {
            ans = min(ans, f[n][j]);
        }
    }
    cout << ans << endl;
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int tt = 1;
    while (tt--) {
        solve();
    }
    return 0;
}