#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int,int> P;
const int INF = 1e9;
int main(){
  int n;
  cin >> n;
  vector<int> a(n), b(n);
  rep(i,n) cin >> a[i] >> b[i];
  vector<vector<int> > dp(n,vector<int>(1<<n,INF));
  for (int i = 0; i < n; i++) dp[i][(1<<i)] = 0;
  int res = INF;
  for (int bit = 0 ; bit < (1<<n); bit++) {
    for (int i = 0; i < n; i++) {
      if (bit&(1<<i)) continue;
      for (int j = 0; j < n; j++) {
        if (!(bit&(1<<j))) continue;
        dp[i][bit | (1 << i)] = min(dp[i][bit | (1<<i)], max(dp[j][bit], b[i] - a[i] + a[j]));
      }
    }
  }
  rep(i,n) res = min(res,dp[i][(1<<n)-1]);
  cout << res << endl;
  return 0;
}