#include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#include <limits>

#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
using ll = long long int;  // NOLINT
using P = pair<ll, ll>;

// clang-format off
#ifdef _DEBUG_
#define dump(...) do{ cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; debug_print(__VA_ARGS__); } while(false)
template<typename T, typename... Ts> void debug_print(const T &t, const Ts &...ts) { cerr << t; ((cerr << ", " << ts), ...); cerr << endl; }
#else
#define dump(...) do{ } while(false)
#endif
template<typename T> vector<T> make_v(size_t a, T b) { return vector<T>(a, b); }
template<typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v(ts...))>(a, make_v(ts...)); }
template<typename T> bool chmin(T &a, const T& b) { if (a > b) {a = b; return true; } return false; }
template<typename T> bool chmax(T &a, const T& b) { if (a < b) {a = b; return true; } return false; }
template<typename T, typename... Ts> void print(const T& t, const Ts&... ts) { cout << t; ((cout << ' ' << ts), ...); cout << '\n'; }
template<typename... Ts> void input(Ts&... ts) { (cin >> ... >> ts); }
template<typename T> istream &operator,(istream &in, T &t) { return in >> t; }
struct Inf { template<typename T> constexpr operator T() { return numeric_limits<T>::max() / 2; } };
// clang-format on

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n;
    cin, n;
    vector<int> a(n), b(n);
    int sum = 0;
    rep(i, 0, n) {
        cin, a[i], b[i];
        sum += a[i];
    }
    const int inf = Inf();
    auto dp = make_v(n + 1, sum + 1, inf);
    dp[0][0] = 0;

    rep(i, 0, n) {
        rep(j, 0, sum + 1) {
            if (dp[i][j] == inf) continue;
            // solve a
            if (j + a[i] <= sum) {
                chmin(dp[i + 1][j + a[i]], dp[i][j]);
            }
            // solve b
            chmin(dp[i + 1][j], dp[i][j] + b[i]);
        }
    }

    int ans = inf;
    rep(i, 0, sum + 1) {
        chmin(ans, max(i, dp[n][i]));
    }

    print(ans);

    return 0;
}