#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cstring>
#include <stack>
#include <queue>
#include <unordered_map>
#include <map>
using namespace std;
#define INF 1000000
int main() {
    int n;
    cin >> n;
    int a[n];
    int b[n];
    int dp[(1<<n)][n];
    
    for(int i=0;i<(1<<n);i++) {
        for(int j=0;j<n;j++) {
            dp[i][j] = INF;
        }
    }

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

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

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