// includes
#include <cstdio>
#include <cstdint>
#include <iostream>
#include <iomanip>
#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <utility>
#include <functional>
#include <cmath>
#include <climits>
#include <bitset>
#include <list>
#include <random>

// macros
#define ll long long int
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())

using namespace std;

//  types
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
 
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1e9 + 7;

// solve
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}

int n;
int a[20], b[20];
int dp[2000000][20];

int calc(int status, int at){
  if(dp[status][at] >= 0)return dp[status][at];
  if(__builtin_popcount(status) == 1)return 0;
  int tstatus = status & (~(1 << at));
  int res = inf;
  for(int j = 0; j < n; j++){
    if((tstatus >> j) % 2 == 1){
      res = min(res, max(b[j] - a[j] + a[at], calc(tstatus, j)));
    }
  }

  return dp[status][at] = res;
}

int main(int argc, char const* argv[])
{
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cin >> n;
  rep(i, n)cin >> a[i] >> b[i];
  for(int i = 0; i < (1 << n); i++){
    for(int j = 0; j < n; j++){
      dp[i][j] = -1;
    }
  }
  int res = inf;
  for(int i = 0; i < n; i++){
    res = min(res, calc((1 << n) - 1, i));
  }
  cout << res << endl;
	return 0;
}