#include<bits/stdc++.h>
using namespace std;
#define int long long int
void solve(){
	int n,a,b,sum=0,ans=1e9;
	cin>>n;
	vector<int>dp(5000100,-1);
	dp[0]=0;
	for(int i=1;i<=n;i++){
		cin>>a>>b;
		sum+=a;
		//cout<<"sum:"<<sum<<"\n";
		dp[sum]=0;
		for(int j=sum-1;j>=max(sum-a+1,a);j--){//之前不可能出现 
			dp[j]=dp[j-a];
			//cout<<"j:"<<j<<" "<<dp[j]<<" "<<dp[j-a]<<"\n";
		}
		for(int j=sum-a;j>=a;j--){
			if(dp[j]>=0)dp[j]=min(dp[j-a],dp[j]+b);//搭配过 
			else dp[j]=dp[j-a];//未搭配过
			//cout<<"j:"<<j<<" "<<dp[j]<<"\n";
		}
		for(int j=min(a-1,sum-a);j>=0;j--){//不能被别的组合得出 
			if(dp[j]>=0)dp[j]+=b;
			//cout<<"j:"<<j<<" "<<dp[j]<<"\n";
		}
		//if(dp[sum-a]==0)dp[sum-a]=b;
	}
	for(int i=0;i<=sum;i++){
		//if(dp[i]>=0)cout<<i<<" "<<dp[i]<<"\n";
		if(dp[i]>=0)ans=min(ans,max(i,dp[i]));
	}
	cout<<ans<<"\n";
	return;
}
signed main(){
	//ios::sync_with_stdio(0);
	//cin.tie(0);cout.tie(0);
	int t=1;
	//cin>>t;
	while(t--){
		solve();
	}
	return 0;
}