#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll n,ans=1e9;
ll a[2005],b[2005];
void dfs(ll i,ll x,ll y){
//    cout<<i<<" "<<x<<" "<<y<<endl;
    if(i>n){
        ans=min(ans,max(x,y));
        return;
    }
    dfs(i+1,x+a[i],y);
    dfs(i+1,x,y+b[i]);
}
int main(){
    freopen("task.in","r",stdin);
    freopen("task.out","w",stdout);
    cin>>n;
    for(int i=1;i<=n;i++)cin>>a[i]>>b[i];
    dfs(1,0,0);
    cout<<ans;
    return 0;
}