#include<bits/stdc++.h>

#define max(a,b) (a>b?a:b)

#define min(a,b) (a<b?a:b)

using namespace std;

#define N 205

int f[N][N*N];//f[前i个人][结束时间]

int sum[N];

struct data {

    int a, b;//a打饭 b吃饭

    bool operator <(const data &now)

        const {

        return b>now.b;

    }

}a[N];

//吃饭慢的先吃 吃饭快的后吃

//然后再DP 选1，2窗口(两种状态)

int main()

{

    int n,ans=0x7fffffff; scanf("%d", &n);

    for (int i = ; i <= n; i++) scanf("%d%d", &a[i].a, &a[i].b);

    sort(a + , a +  + n);

    for (int i = ; i <= n; i++) sum[i] = sum[i - ] + a[i].a;

    memset(f, , sizeof(f));

    f[][] = ;

    for (int i = ; i <= n; i++)//枚举人数

    {

        for (int j = ; j <= sum[i]; j++)

        {

            if(j>=a[i].a) f[i][j]=min(max(f[i-][j-a[i].a],j+a[i].b),f[i][j]);

            f[i][j]=min(f[i][j],max(f[i-][j],sum[i]-j+a[i].b));

        }

    }

    for(int i=;i<=sum[n];i++)ans = min(ans, f[n][i]);

    printf("%d", ans);

    return ;

}