#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int n;
vector<int> a, b;

vector<vector<int>> dp;

int f(int mask, int last){
    if(dp[last][mask] != -1) return dp[last][mask];

    dp[last][mask] = 1 << 30;
    for(int i = 0; i < n; i++){
        if(i == last) continue;
        if((mask >> i) & 1){
            int premask = mask ^ (1 << last);
            dp[last][mask] = min(dp[last][mask], max(f(premask, i), b[i]-a[i]+a[last]));
        }
    }
    return dp[last][mask];
}

int main(){
    cin >> n;
    a = vector<int>(n);
    b = vector<int>(n);
    for(int i = 0; i < n; i++) cin >> a[i] >> b[i];

    dp = vector<vector<int>>(n, vector<int>(1 << n, -1));
    for(int i = 0; i < n; i++) dp[i][1 << i] = 0;
    
    int ans = 1 << 30;
    for(int i = 0; i < n; i++) ans = min(ans, f((1 << n)-1, i));
    cout << ans << endl;
    return 0;
}