#include <iostream>
#include <vector>

constexpr int INF = 1 << 30;

void solve() {
    int n;
    std::cin >> n;

    std::vector<int> dp(1, 0);
    while (n--) {
        int a, b;
        std::cin >> a >> b;

        int m = dp.size() - 1;
        dp.resize(m + a + 1, INF);
        for (int i = m + a; i >= 0; --i) {
            dp[i] += b;
            if (i >= a) dp[i] = std::min(dp[i], dp[i - a]);
        }
    }

    int ans = INF;
    for (int t = 0; t < (int)dp.size(); ++t) {
        ans = std::min(ans, std::max(t, dp[t]));
    }

    std::cout << ans << "\n";
}

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

    solve();

    return 0;
}