#include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <bitset>
#include <iomanip>
#include <limits>
#include <chrono>
#include <random>
#include <array>
#include <unordered_map>
#include <functional>
#include <complex>
#include <numeric>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
constexpr long long MAX = 5100000;
constexpr long long INF = 1LL << 60;
constexpr int inf = 1000000007;
//constexpr long long mod = 1000000007LL;
constexpr long long mod = 998244353LL;
const long double PI = acos((long double)(-1));

using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;

int dp[101][100001];
int main()
{
    /*
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    */
    constexpr int mx = 100000;
    for (int i = 0; i <= 100; i++) for (int j = 0; j <= mx; j++) dp[i][j] = inf;
    dp[0][0] = 0;
    int n; scanf("%d", &n);
    vector<int> a(n), b(n);
    for (int i = 0; i < n; i++) scanf("%d %d", &a[i], &b[i]);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j <= mx; j++) {
            if (dp[i][j] == inf) continue;
            if (j + a[i] <= mx) chmin(dp[i + 1][j + a[i]], dp[i][j]);
            chmin(dp[i + 1][j], dp[i][j] + b[i]);
        }
    }
    int res = inf;
    for (int i = 0; i <= mx; i++) chmin(res, max(i, dp[n][i]));
    cout << res << endl;
	return 0;
}