import std.stdio, std.string, std.conv;
import std.range, std.algorithm, std.array, std.typecons, std.container;
import std.math, std.numeric, core.bitop;

alias Pair = Tuple!(int, "a", int, "b");

void main() {
    int n;
    scan(n);
    auto a = new int[](n);
    auto b = new int[](n);
    foreach (i ; 0 .. n) {
        int ai, bi;
        scan(ai, bi);
        a[i] = ai;
        b[i] = bi;
    }

    int ans = min(solve(n, a.dup, b.dup), solve(n, b.dup, a.dup));

    writeln(ans);
}

int solve(int n, int[] a, int[] b) {
    auto bs = b.sum();
    b[] *= -1;

    immutable lim = n * 1000;
    auto dp = new int[](lim + 1);

    foreach (i ; 0 .. n) {
        foreach_reverse (j ; a[i] .. lim + 1) {
            dp[j] = min(dp[j], dp[j - a[i]] + b[i]);
        }
    }

    int ans = 10^^9;

    foreach (i ; 0 .. lim + 1) {
        ans = min(ans, max(i, bs + dp[i]));
    }

    return ans;
}


































void scan(T...)(ref T args) {
    import std.stdio : readln;
    import std.algorithm : splitter;
    import std.conv : to;
    import std.range.primitives;

    auto line = readln().splitter();
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront();
    }
    assert(line.empty);
}



void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}