#include <iostream>
#include <climits>
using namespace std;
const int N = 55;
#define int ll
using ll=long long;
const int M=1e9+7;
int n;
const int N1=5e5+5;
int a[N], b[N];
int dp[N][N1];
signed main() {
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> a[i] >> b[i];
    }
    for (int i = 0; i <= n; i++) {
        for (int j = 0; j <=N1-1; j++) {
            dp[i][j]=M;
        }
    }
    dp[0][0] = 0;
    for (int i = 1; i <= n; i++) {
        for (int j = 0; j <= N1-1; j++) {
            if (j + a[i] <= N1-1) {
                dp[i][j + a[i]] = min(dp[i][j + a[i]], max(dp[i - 1][j], j + a[i]));
            }
            dp[i][j] = min(dp[i][j], max(dp[i - 1][j], dp[i - 1][j] + b[i]));
        }
    }
    int ans =M;
    for (int j = 0; j <= N1-1; j++) {
        if (dp[n][j]!=M) {
            ans = min(ans, dp[n][j]);
        }
    }
    cout << ans << endl;
    return 0;
}