#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; (i) < int(n); ++ (i))
#define ALL(x) begin(x), end(x)
using namespace std;
template <class T> inline void chmin(T & a, T const & b) { a = min(a, b); }

int main() {
    // input
    int n; cin >> n;
    vector<int> a(n), b(n);
    REP (i, n) cin >> a[i] >> b[i];

    // solve
    int sum_a = accumulate(ALL(a), 0);
    vector<int> cur(sum_a + 1, INT_MAX);
    cur[0] = 0;
    REP (i, n) {
        vector<int> nxt(sum_a + 1, INT_MAX);
        REP (x, sum_a + 1) if (cur[x] != INT_MAX) {
            if (x + a[i] <= sum_a) {
                chmin(nxt[x + a[i]], cur[x]);
            }
            chmin(nxt[x], cur[x] + b[i]);
        }
        cur.swap(nxt);
    }
    int answer = INT_MAX;
    REP (x, sum_a + 1) if (cur[x] != INT_MAX) {
        chmin(answer, max(x, cur[x]));
    }

    // output
    cout << answer << endl;
    return 0;
}