#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((ll)(x).size())
#define len(x) ((ll)(x).length())
#define endl "\n"

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    // ifstream in("input.txt");
    // cin.rdbuf(in.rdbuf());
    const ll inf = LONG_LONG_MAX / 2 - 1;
    ll n;
    cin >> n;
    vector<ll> a(n), b(n);
    rep(i, n) cin >> a[i] >> b[i];
    vector<vector<ll>> dp(1 << n, vector<ll>(n, inf));
    rep(i, n) dp[1 << i][i] = 0;
    rep(bit, 1 << n) {
        rep(i, n) {
            if ((bit & (1 << i)) == 0) continue;
            rep(j, n) {
                ll nb = bit | (1 << j);
                if (bit == nb) continue;
                ll d = (b[i] - a[i]) + a[j];
                ll idx = bit | (1 << j);
                dp[idx][j] = min(dp[idx][j], max(dp[bit][i], d));
            }
        }
    }
    ll ans = inf;
    rep(i, n) ans = min(ans, dp[(1 << n) - 1][i]);
    cout << ans << endl;
    return 0;
}