//#include <bits/stdc++.h>

#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cstring>
#include <complex>
#include <stack>
#include <queue>
#include <unordered_map>
#include <map>

#define INF 100000000
#define rep(i, a) for (int i = 0; i < (a); i++)
using namespace std;

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

    int dp[1<<n][n];
    for(i = 0; i < (1<<n); i++){
        for(j = 0; j < n; j++){
            dp[i][j] = INF;
        }
    }
    for(i = 0; i < n; i++){
        dp[1<<i][i] = 0;
    }

    for(i = 0; i < (1<<n); i++){
        for(j = 0; j < n; j++){
            for(k = 0; k < n; k++){
                if((i>>k)%2 == 1) continue;
                int nexti = i | (1<<k);
                int nextd = max(dp[i][j], b[j]-a[j]+a[k]);
                dp[nexti][k] = min(dp[nexti][k], nextd);
            }
        }
    }

    int ans = INF;
    int all = (1<<n)-1;
    for(i = 0; i < n; i++){
        ans = min(ans, dp[all][i]);
    }
    cout << ans << endl;
}