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


#define INF 1e9
using namespace std;

int main()
{

    int n;
    cin >> n;
    vector<pair<long long int, long long int>> x; 
    for (int i = 0; i < n; i++)
    {
        int j, k;
        cin >> j >> k;
        x.push_back(make_pair(j, k - j));

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

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

    }

    for (int i = 1; i < (1 << n); i++)
    {
        for (int j = 0; j < n; j++)
        {

            for (int k = 0; k < n; k++)
            {
                if ((i >> k) % 2 == 1)
                    continue;
                int nexti = i | (1 << k);
 
                b[nexti][k] = min(b[nexti][k], max(b[i][j], x[j].second + x[k].first));
   
            }
        }
    }
    int ans = INF;
    for (int i = 0; i < n; i++)
    {
        if (b[(1 << n) - 1][i] < ans)
        {
            ans = b[(1 << n) - 1][i];
        }
    }
    cout << ans << endl;
    return 0; 
}