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

constexpr int INF = 1e9;

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N;
    cin >> N;
    vector<int> As(N, 0);
    vector<int> Bs(N, 0);
    for (int i = 0; i < N; ++i){
        cin >> As[i] >> Bs[i];
        Bs[i] -= As[i];
    }
    vector<vector<int>> dp(1 << N, vector<int>(N, INF));
    // dp[used][tail] bit列 usedであらわされる本を使用済みで、一番右の本がtailであるときの、スコアの最小値
    // dp[used|(1<<k)][k] = min(dp[used|(1<<k)][k], max(dp[used][tail], Bs[tail]+As[k]))
    for (int tail = 0; tail < N; ++tail) dp[1<<tail][tail] = 0;
    for (int used = 1; used < (1<<N); ++used){
        for (int tail = 0; tail < N; ++tail){
            if ((used & (1<<tail)) == 0) continue;
            for (int k = 0; k < N; ++k){
                if ((used & (1<<k))) continue;
                dp[used|(1<<k)][k] = min(dp[used|(1<<k)][k], max(dp[used][tail], Bs[tail] + As[k]));
            }
        }
    }
    cout << *min_element(dp[(1<<N) - 1].begin(), dp[(1<<N) - 1].end()) << endl;
    return 0;
}