#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef vector< int > vi;
typedef vector< vi > vvi;
typedef vector< ll > vl;
typedef vector< vl > vvl;
typedef pair< int, int > pii;
typedef vector< pii > vp;
typedef vector< double > vd;
typedef vector< vd > vvd;
typedef vector< string > vs;

template< class T1, class T2 >
int upmin( T1 &x, T2 v ){
  if( x > v ){
    x = v;
    return 1;
  }
  return 0;
}

template< class T1, class T2 >
int upmax( T1 &x, T2 v ){
  if( x < v ){
    x = v;
    return 1;
  }
  return 0;
}

const int INF = 0x3f3f3f3f;

int N;
vp v_t;

void init(){
  cin >> N;
  v_t = vp( N );
  for( int i = 0; i < N; ++i )
    cin >> v_t[ i ].first >> v_t[ i ].second;
}

const int MAXT = ( int ) 1e4;
const int MAXV = ( int ) 1e4;

int dp[ MAXT + MAXV + 1 ];

void preprocess(){
  sort( v_t.begin(), v_t.end(), 
      [ & ]( pii a, pii b ){
        return a.first + a.second < b.first + b.second;
      } );
  dp[ 0 ] = 1;
  for( int i = 0; i < N; ++i )
    for( int j = v_t[ i ].second - 1; j >= 0; --j )
      dp[ j + v_t[ i ].first ] |= dp[ j ];
}

void solve(){
  for( int i = MAXT + MAXV; i >= 0; --i )
    if( dp[ i ] )
      cout << i << endl, exit( 0 );
}

signed main(){
  ios::sync_with_stdio( 0 );
  init();
  preprocess();
  solve();
  return 0;
}