#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);
	for(int i=1;i<=n;i++){
		cin>>a>>b;
		sum+=a;
		//cout<<"sum:"<<sum<<"\n";
		dp[sum]=-1;
		for(int j=sum-1;j>=a;j--){
			if(dp[j]>0)dp[j]=min(dp[j-a],dp[j]+b);
			else if(dp[j]==0)dp[j]=dp[j-a];
			else if(dp[j]==-1)dp[j]=min(dp[j-a],dp[j]+b+1);
			//if(dp[j])cout<<"j:"<<j<<" "<<dp[j]<<" "<<dp[j-a]<<"\n";
		}
		for(int j=a-1;j>=0;j--){
			if(dp[j])dp[j]+=b;
			//if(dp[j])cout<<"j:"<<j<<" "<<dp[j]<<"\n";
		}
		if(dp[sum-a]<=0)dp[sum-a]=b;
		else dp[sum-a]=min(dp[sum-a],b);
	}
	for(int i=0;i<sum;i++){
		//if(dp[i])cout<<i<<" "<<dp[i]<<"\n";
		if(dp[i])ans=min(ans,max(i,dp[i]));
	}
	ans=min(ans,sum);
	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;
}