#include <cassert>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <string.h>
#include <vector>

using namespace std;
typedef long long ll;

int main() {
  int N;
  cin >> N;
  int A[N];
  int B[N];

  for (int i = 0; i < N; ++i) {
    cin >> A[i] >> B[i];
  }

  int L = 1 << N;
  int dp[L][N];
  memset(dp, -1, sizeof(dp));
  memset(dp[0], 0, sizeof(dp[0]));

  for (int mask = 0; mask < L; ++mask) {
    for (int i = 0; i < N; ++i) {
      if (mask >> i & 1) continue;
      int nmask = mask | (1 << i);

      for (int j = 0; j < N; ++j) {
        if (dp[mask][j] == -1) continue;
        int ndist = dp[mask][j];

        if (__builtin_popcount(mask) != 0) {
          ndist = max(ndist, (B[j] - A[j]) + A[i]);
        }

        if (dp[nmask][i] == -1) {
          dp[nmask][i] = ndist;
        } else {
          dp[nmask][i] = min(dp[nmask][i], ndist);
        }
      }
    }
  }

  int ans = INT_MAX;

  for (int i = 0; i < N; ++i) {
    ans = min(ans, dp[L - 1][i]);
  }

  cout << ans << endl;

  return 0;
}