#include <bits/stdc++.h>
using namespace std;

#define rep(i,j,n) for(int i=j;i<n;++i)
#define all(i) i.begin(),i.end()
#define rall(i) i.rbegin(), i.rend()
#define INF 1e9
#define LINF 1e18
const int mod = 1e9 + 7;

typedef long long i64;
typedef pair<int, int> pi;

template <class T> using vt = vector<T>;
template <class T> using vvt = vector<vector<T>>;

i64 gcd(i64 n, i64 m) {return (m == 0? n : gcd(m, n % m));}
i64 lcd(i64 n, i64 m) {return (n / gcd(n, m) * m);}
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};

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

  int n;
  cin >> n;
  vt<int> a(n), b(n);
  rep(i, 0, n) cin >> a[i] >> b[i];

  vvt<int> dp((1 << n), vt<int>(n, INF));
  rep(bit, 0, (1 << n)) {
    rep(i, 0, n) {
      if(!(bit & (1 << i))) continue;

      rep(j, 0, n) {
        if(bit & (1 << j)) continue;

        int nxt = bit | (1 << j);
        if(dp[bit][i] == INF) dp[nxt][j] = min(dp[nxt][j], a[j] + b[i] - a[i]);
        else dp[nxt][j] =  min(dp[nxt][j], max(dp[bit][i], a[j] + b[i] - a[i]));
      }
    }
  }

  int ans = INF;
  rep(i, 0, n) ans = min(ans, dp[(1 << n) - 1][i]);
  cout << ans << endl;
}