#include<cstdio>
#include<cstring>
#include<algorithm>
#include<utility>
#define rep(i,a) for(int i=0;i<(a);++i)
#define repd(i,a) for(int i=(a);i>=0;--i)
#define clr(a,v) memset((a),(v),sizeof(a))

typedef std::pair<int, int> P;

const int MAX_N = 10000;

int N;
P ps[MAX_N];
bool dp[MAX_N+1];

int main()
{
	scanf( "%d", &N );
	rep( i, N )
	{
		int V, T;
		scanf( "%d%d", &V, &T );
		ps[i] = P( V, T );
	}

	std::sort( ps, ps+N, []( const P &lhs, const P &rhs ){ return lhs.first+lhs.second < rhs.first+rhs.second; }  );
	clr( dp, false );
	dp[0] = true;

	int ans = 0;
	rep( i, N )
	{
		repd( j, ps[i].second-1 )
		{
			if( !dp[j] )
				continue;

			ans = std::max( ans, j+ps[i].first );

			if( j+ps[i].first <= MAX_N )
				dp[j+ps[i].first] |= dp[j];
		}
	}

	printf( "%d\n", ans );

	return 0;
}