#include <bits/stdc++.h>
using namespace std;
const int N=2020;
struct node {
    int l,r;
} a[N];
int n,mi=1e9;
void dfs(int step,int nowa,int nowb)
{
    if (step==n+1)
    {
        if (max(nowa,nowb)<mi)
        {
            mi=max(nowa,nowb);
        }
        return ;
    }
    dfs(step+1,nowa+a[step].l,nowb);
    dfs(step+1,nowa,nowb+a[step].r);
}
int main() {
    freopen("task.in","r",stdin);
    freopen("task.out","w",stdout);
    scanf("%d",&n);
    for (int i=1;i<=n;i++)
    {
        scanf("%d%d",&a[i].l,&a[i].r);
    }
    dfs(1,0,0);
    printf("%d",mi);
}