#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll=long long;
using ld=long double;
ld pie=3.141592653589793;
ll inf=1444999999994;
ll mod=1000000007;
int main(){
    ll n;
    cin >> n;
    vector<ll>a(n),b(n);
    for (ll i = 0; i < n; i++)
    {
        cin >> a[i] >> b[i];
    }
    vector<ll>two(30,1);
    for (ll i = 0; i < 29; i++)
    {
        two[i+1]=two[i]*2;
    }
    vector<vector<ll>>dp(two[n],vector<ll>(n,inf));
    for (ll i = 0; i < n; i++)
    {
        dp[two[i]][i]=0;
    }
    for (ll i = 1; i < two[n]; i++)
    {
        for (ll j = 0; j < n; j++)
        {
            if (!(i&two[j]))
            {
                continue;
            }
            for (ll k = 0; k < n; k++)
            {
                if (i&two[k])
                {
                    continue;
                }
                dp[i+two[k]][k]=min(dp[i+two[k]][k],max(dp[i][j],b[j]-a[j]+a[k]));
            }
        }
    }
    ll ans=inf;
    for (ll i = 0; i < n; i++)
    {
        ans=min(ans,dp[two[n]-1][i]);
    }
    cout << ans << endl;
}