#include<bits/stdc++.h>

using namespace std;

//input

#define rep(i,a,b) for(int i=(a);i<=(b);i++)

#define RI(n) scanf("%d",&(n))

#define RII(n,m) scanf("%d%d",&n,&m);

#define RIII(n,m,k) scanf("%d%d%d",&n,&m,&k)

#define RS(s) scanf("%s",s);

#define LL long long

#define REP(i,N)  for(int i=0;i<(N);i++)

#define CLR(A,v)  memset(A,v,sizeof A)

//////////////////////////////////

#define N 10005

int a[N];

int b[N];

int dp[N][N];

int main()

{

    int n;

    RI(n);

    rep(i,,n)

    RII(a[i],b[i]);

    long sum=;

    rep(i,,n)

    {

        sum+=a[i];

        rep(j,,sum)

        {

            dp[i][j]=dp[i-][j]+b[i];//先让b来做试试

            if(j>=a[i])dp[i][j]=min(dp[i][j],dp[i-][j-a[i]]);//再加上a来比对  哪个时间短

        }

    }

    int minn=0x3f3f3f3f;

    rep(i,,sum)

    minn=min(minn,max(i,dp[n][i]));//注意求极值的写法

    cout<<minn;

}