#include <bits/stdc++.h>
using namespace std;
 
#define int long long
//#define uint __int128_t
 
#define pb push_back
#define fi first
#define se second
#define rep(i,s,n) for(int i = s;i<n;i++)
#define repe(i,s,n) for(int i = s;i<=n;i++)
#define rrep(i,s,n) for(int i = (n)-1;i>=(s);i--)
#define all(v) (v).begin(),(v).end()
#define chmin(a,b) a=min((a),(b))
#define chmax(a,b) a=max((a),(b))
#define low(a,b) lower_bound(all(a),(b))-(a).begin()
#define upp(a,b) upper_bound(all(a),(b))-(a).begin()
#define fill(i,n) memset(i,n,sizeof(i))
#define endl '\n'
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0)
typedef long long ll;
typedef pair<int,int>pint;
typedef vector<int>vint;
typedef vector<vint> vvint;
typedef vector<pint>vpint;
typedef pair<pint,int> P1;
typedef pair<int,pint> P2;
typedef pair<pint,pint> PP;
static const ll maxLL = (ll)1 << 62;
const ll MOD=1000000007;
const ll INF=1e18;

int dp[1<<20][20];
int tmp,tmpbit;
signed main() {
    IOS();
    //(1ll<<N)シフト演算のオーバーフローに気をつける
    int N;
    cin>>N;
    vint a(N),b(N);
    rep(i,0,N){
        cin>>a[i]>>b[i];
        b[i]-=a[i];
    }
    rep(bit,0,(1<<N))rep(i,0,N)dp[bit][i]=INF;
    rep(bit,0,(1<<N))rep(i,0,N)if(bit&(1<<i)){
        rep(j,0,N)if(!(bit&(1<<j))){
            tmp=(dp[bit][i]==INF)?b[i]+a[j]:max(dp[bit][i],b[i]+a[j]);
            tmpbit=bit|(1<<j);
            chmin(dp[tmpbit][j],tmp);
        }
    }
    int ans=INF;
    rep(i,0,N)chmin(ans,dp[(1<<N)-1][i]);
    cout<<ans<<endl;
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
    return 0;
}