#include <iostream>
#include <vector>
#include <algorithm>

template <class T>
std::vector<T> vec(int len, T elem) { return std::vector<T>(len, elem); }

constexpr int INF = 1 << 30;

void solve() {
    int n;
    std::cin >> n;

    std::vector<std::pair<int, int>> ps(n);
    for (auto& p : ps) {
        int a, b;
        std::cin >> a >> b;
        p = std::make_pair(a, b - a);
    }

    auto dp = vec(n, vec(1 << n, INF));
    for (int i = 0; i < n; ++i) dp[i][1 << i] = 0;

    for (int b = 0; b < (1 << n); ++b) {
        for (int i = 0; i < n; ++i) {
            for (int j = 0; j < n; ++j) {
                if ((b >> j) & 1) continue;

                int nd = std::max(dp[i][b], ps[i].second + ps[j].first);
                int nb = b | (1 << j);
                dp[j][nb] = std::min(dp[j][nb], nd);
            }
        }
    }

    int ans = INF;
    for (int i = 0; i < n; ++i) ans = std::min(ans, dp[i].back());

    std::cout << ans << "\n";
}

int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    solve();

    return 0;
}