#include <iostream>
#include <algorithm>
#include <iomanip>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = uint32_t;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;

template <class T, class U>
vector<T> make_v(U size, const T& init){ return vector<T>(static_cast<size_t>(size), init); }

template<class... Ts, class U>
auto make_v(U size, Ts... rest) { return vector<decltype(make_v(rest...))>(static_cast<size_t>(size), make_v(rest...)); }

template<class T> void chmin(T &a, const T &b){ a = (a < b ? a : b); }
template<class T> void chmax(T &a, const T &b){ a = (a > b ? a : b); }

int main() {
    int n;
    cin >> n;
    vector<int> a(n), b(n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i] >> b[i];
    }
    auto dp = make_v(1<<n, n, INF<int>);
    for (int i = 0; i < n; ++i) {
        dp[1<<i][i] = 0;
    }
    for (int i = 0; i < (1<<n); ++i) {
        if(__builtin_popcount(i) < 2) continue;
        for (int j = 0; j < n; ++j) {
            if(i & (1<<j)) {
                for (int k = 0; k < n; ++k) {
                    if((i & (1<<k)) && j != k) chmin(dp[i][j], max(dp[i^(1<<j)][k], a[j]+b[k]-a[k]));
                }
            }
        }
    }
    cout << *min_element(dp.back().begin(),dp.back().end()) << "\n";
    return 0;
}