#include<bits/stdc++.h>
using namespace std;
const int N=20005;
int a[N],b[N];
int n;
int res=2147483647;
void dfs(int ta,int tb,int idx){
    if(max(ta,tb)>res){
        return;
    }
    if(idx>n){
        res=min(res,max(ta,tb));
        return;
    }
    if(idx==1){
        dfs(ta+a[idx],tb,idx+1); 
        dfs(ta,tb+b[idx],idx+1);
    }
    else if(tb>ta){
        dfs(ta+a[idx],tb,idx+1);
    }
    else{
        dfs(ta,tb+b[idx],idx+1);
    }
}
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(0,0,0);
    cout<<res;
    return 0;
}