#include<bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
typedef long long LL;
int N;
int A[101];
int B[101];
int dp[100011];
int pre[100011];
int main(){
	cin>>N;
	int s=0;
	REP(i,N){
		cin>>A[i]>>B[i];
		s+=B[i];
	}
	REP(i,100011){
		dp[i]=s;
	}
	REP(i,N){
		REP(j,100011){
			pre[j]=dp[j];
		}
		REP(j,10011){
			if(j+A[i]<100001){
				dp[j+A[i]]=min(dp[j+A[i]],pre[j]-B[i]);
			}
		}
		/*REP(j,101){
			cout<<dp[j]<<endl;
		}
		cout<<"end"<<endl;*/
	}
	
	int ans=1e7;
	REP(i,10011){
		ans=min(ans,max(dp[i],i));
	}
	cout<<ans<<endl;
	return(0);
}