#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (unsigned short i = 0, _##i = (n); i < _##i; ++i)
#define INF 50000
#define MAX_N 20
unsigned short N, new_max, new_bit, A[MAX_N], B[MAX_N], DP[1 << MAX_N][MAX_N];

signed main() {
    cin >> N;
    rep(i, N) cin >> A[i] >> B[i], B[i] -= A[i];
    rep(bit, 1 << N) rep(i, N) DP[bit][i] = INF;
    rep(bit, (1 << N)) {
        rep(i, N) {
            if (!(bit & (1LL << i))) continue;
            rep(j, N) {
                if (bit & (1LL << j)) continue;
                new_max = DP[bit][i] == INF ? B[i] + A[j] : max(int(DP[bit][i]), B[i] + A[j]);
                new_bit = bit | (1 << j);
                DP[new_bit][j] = min(DP[new_bit][j], new_max);
            }
        }
    }
    cout << *min_element(DP[(1 << N) - 1], DP[(1 << N) - 1] + N) << endl;
}