#include<bits/stdc++.h>
using namespace std; 
#define ll long long 
#define maxn 500009 
#define fi first 
#define se second 
#define pb push_back 
#define re exit(0);

const int mod = 1e9+7 ; 
const int INF = 1e9 ; 

typedef vector<int> vi ; 
typedef pair<int,int> pii ;
typedef vector<pii> vii ;  

template < typename T > void chkmin ( T &a , T b ) { if ( a > b ) a = b ; } ; 
template < typename T > void chkmax ( T &a , T b ) { if ( a < b ) a = b ; } ; 
void runfile () 
{
    freopen ("inp.txt","r",stdin) ; 
}

int n ; 
int dp [2][maxn] ;
int a [maxn] , b [maxn] ; 
int main() 
{
    ios_base::sync_with_stdio(0); 
    cin.tie(0);cout.tie(0) ; 
//    runfile() ;     
    cin >> n ; 
    const int N = 1e5 * n  ;  
    for ( int i = 1 ; i <= n ; i ++ ) cin >> a [i] >> b [i] ; 
    
    memset ( dp , 0x3f , sizeof dp ) ; 
    
    dp [0][0] = 0 ; 
    
    for ( int i = 1 ; i <= n ; i ++ ) 
    {
    	for ( int j = 0 ; j <= N ; j ++ ) 
    	{
    		if ( j + a [i] <= N ) chkmin (dp[1][j+a[i]],dp[0][j]) ; 
    		chkmin (dp[1][j],dp[0][j]+b[i]) ; 
		}
		for ( int j = 0 ; j <= N ; j ++ ) dp [0][j] = dp [1][j] , dp [1][j] = INF ; 
	}
	
	int res = INF ;
	for ( int i = 0 ; i <= N ; i ++ ) chkmin (res,max(i,dp[0][i])) ; 
	cout << res ; 
}