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

void main() {
    auto N = readln.chomp.to!int;
    auto A = iota(N-1).map!(_ => readln.split.map!(to!int).array).array;

    auto x = A.map!(a => a[0]).sum;
    auto y = A.map!(a => a[1]).sum;

    auto M = 2 * N;
    auto ff = new FordFulkerson!int(M, M-2, M-1);
    foreach (i; 0..N-1) {
        ff.add_edge(M-2, i, A[i][0]);
        ff.add_edge(i+N-1, M-1, A[i][1]);
    }
    foreach (i; 0..N-1) foreach (j; 0..N-1) if (i != j) {
        ff.add_edge(i, j+N-1, 10000000);
    }

    int lb = max(0, x - ff.run);

    writeln(x - lb + 1);
}

class FordFulkerson(T) {
    int N, source, sink;
    int[][] adj;
    T[][] flow;
    bool[] used;

    this(int n, int s, int t) {
        N = n;
        source = s;
        sink = t;
        assert (s >= 0 && s < N && t >= 0 && t < N);
        adj = new int[][](N);
        flow = new T[][](N, N);
        used = new bool[](N);
    }

    void add_edge(int from, int to, T cap) {
        adj[from] ~= to;
        adj[to] ~= from;
        flow[from][to] = cap;
    }

    T dfs(int v, T min_cap) {
        if (v == sink)
            return min_cap;
        if (used[v])
            return 0;
        used[v] = true;
        foreach (to; adj[v]) {
            if (!used[to] && flow[v][to] > 0) {
                auto bottleneck = dfs(to, min(min_cap, flow[v][to]));
                if (bottleneck == 0) continue;
                flow[v][to] -= bottleneck;
                flow[to][v] += bottleneck;
                return bottleneck;
            }
        }
        return 0;
    }

    T run() {
        T ret = 0;
        while (true) {
            foreach (i; 0..N) used[i] = false;
            T f = dfs(source, T.max);
            if (f > 0)
                ret += f;
            else
                return ret;
        }
    }
}