#include<bits/stdc++.h>
using namespace std;
using ll = long long;

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << endl

const ll mod = 1e9 + 7;
const ll inf = 1e18;

ll N;
ll A[20];
ll B[20];
ll dp[1LL<<20][20];

ll rec(ll mask, ll last){
    if(dp[mask][last]!=inf){
        return dp[mask][last];
    }

    ll mask2 = mask & ~(1<<last); // 穴を開ける
    
    ll mi = inf;
    FOR(old, 0, N){
        if(((mask2>>old)&1) == 0) continue; // 穴を開ける場所はフラグが立っていること
        ll ug0 = rec(mask2, old);
        ll ug1 = B[old]-A[old]+A[last];
        ll ma = max(ug0, ug1);
        chmin(mi, ma);
    }
    return dp[mask][last] = mi;
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    // input
    cin >> N;
    FOR(i, 0, N){ 
        cin >> A[i] >> B[i]; 
    }

    FOR(msk, 0, 1LL<<N){
        FOR(i, 0, N){
            dp[msk][i] = inf;
        }
    }
    FOR(i, 0, N){
        dp[1LL<<i][i] = 0;
    }

    ll ans = inf;
    FOR(i, 0, N){
        ll ugly = rec((1<<N)-1, i);
        chmin(ans, ugly);
    }
    p(ans);
    
    return 0;
}