#include<iostream>
#include<cstdio>
using namespace std;
int n,a[2010],b[2010],ans;
void dfs(int x,int sa,int sb)
{
    if(x==n+1)
    {
        ans=min(ans,max(sa,sb));
        return;
    }
    dfs(x+1,sa+a[x],sb);
    dfs(x+1,sa,sb+b[x]);
}
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],&b[i]);
   } 
   ans=0x3f3f3f3f;
   dfs(1,0,0);
   printf("%d",ans);
   return 0;
}