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

int main(){
    int n;
    cin>>n;
    vector<int> a(n),b(n);
    for(int i = 0;i<n;i++) cin>>a[i]>>b[i];
    vector<vector<int> >dp(1<<n,vector<int>(n,1e9));
    for(int i = 0;i<n;i++) dp[1<<i][i] = 0;
    for(int i = 1;i<1<<n;i++){
        for(int j = 0;j<n;j++) if(i>>j&1) {
            for(int k = 0;k<n;k++) if(~i>>k&1) {
                int now = b[j] - a[j] + a[k];
                dp[i|1<<k][k] = min(dp[i|1<<k][k],max(now,dp[i][j]));
            }
        }
    }
    int ans = 1e9;
    for(int i = 0;i<n;i++) ans = min(ans,dp[(1<<n)-1][i]);
    cout<<ans<<endl;
}