#include <bits/stdc++.h>
using namespace std;
#define GET_MACRO(a, b, c, NAME, ...) NAME
#define rep(...) GET_MACRO(__VA_ARGS__, rep3, rep2)(__VA_ARGS__)
#define rep2(i, a) rep3 (i, 0, a)
#define rep3(i, a, b) for (int i = (a); i < (b); i++)
#define repr(...) GET_MACRO(__VA_ARGS__, repr3, repr2)(__VA_ARGS__)
#define repr2(i, a) repr3 (i, 0, a)
#define repr3(i, a, b) for (int i = (b) - 1; i >= (a); i--)
template<class T1, class T2> inline bool chmin(T1 &a, T2 b) { return b < a && (a = b, true); }
template<class T1, class T2> inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
using ll = long long;

int main() {
	int n;
	cin >> n;
	vector<int> v(n), t(n);
	vector<tuple<int, int, int>> vt(n);
	rep (i, n) cin >> v[i] >> t[i], vt[i] = make_tuple(v[i] + t[i], v[i], t[i]);
	sort(vt.begin(), vt.end());
	rep (i, n) tie(ignore, v[i], t[i]) = vt[i];

	bitset<20202> dp;
	dp[0] = 1;

	rep (i, n) {
		bitset<20202> mask;
		mask.set();
		mask <<= t[i];

		dp = dp | ((dp & ~mask) << v[i]);
	}

	int ans = 0;
	rep (i, 20202) if (dp[i]) ans = i;
	cout << ans << endl;

	return 0;
}