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;

enum inf = 1<<30;

void main() {
    int n;
    scan(n);

    auto a = new int[](n);
    auto b = new int[](n);

    foreach (i ; 0 .. n) {
        scan(a[i], b[i]);
    }

    auto dp = new int[][](1<<n, n);
    //fillAll(dp, inf);

    foreach (s ; 0 .. 1<<n) {
        foreach (i ; 0 .. n) {
            if (!(s & (1<<i))) {
                continue;
            }

            int ss = s ^ (1<<i);

            if (!ss) {
                continue;
            }

            dp[s][i] = inf;

            foreach (j ; 0 .. n) {
                if (!(ss & (1<<j))) {
                    continue;
                }
                auto t = max(dp[ss][j], a[i] + b[j] - a[j]);
                dp[s][i] = min(dp[s][i], t);
            }
        }
    }

    int ans = inf;

    foreach (i ; 0 .. n) {
        ans = min(ans, dp[(1<<n) - 1][i]);
    }

    writeln(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);
        }
    }
}