#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//

int main() {
	int N;
	cin >> N;
	vector<int> A(N), B(N);
	REP(i, N) scanf("%d %d", &A[i], &B[i]), B[i] -= A[i];
	vector dp(1 << N, vector<int>(N, INF));
	REP(i, N) dp[1 << i][i] = 0;
	REP(i, 1 << N) {
		REP(j, N) {
			if (dp[i][j] == INF) continue;
			REP(k, N) if (~i >> k & 1) {
				chmin(dp[i | 1 << k][k], max(dp[i][j], B[j] + A[k]));
			}
		}
	}
	cout << *min_element(ALL(dp[(1 << N) - 1])) << endl;
}