#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
//-------------------------------------------------------

int N;
int A[101],B[101];

int from[101010];
int to[101010];

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N;
	FOR(i,101000) from[i]=1<<30;
	from[0]=0;
	
	FOR(i,N) {
		cin>>A[i]>>B[i];
		FOR(j,101000) to[j]=1<<30;
		FOR(j,100001) {
			to[j+A[i]]=min(to[j+A[i]],from[j]);
			to[j]=min(to[j],from[j]+B[i]);
		}
		
		
		swap(from,to);
	}
	
	int mi=1<<30;
	FOR(i,101000) mi=min(mi,max(i,from[i]));
	cout<<mi<<endl;
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}