#include <bits/stdc++.h>

using namespace std;

const int mxn = 1e5+5;
const long long INF = 0x3f3f3f3f;

typedef long long ll;

int main(){
    ios_base::sync_with_stdio(0), cin.tie(nullptr);

    int n;
    cin >> n;
    
    vector<pair<int, int> > v(n);

    for(int i=0; i<n; i++){
        cin >> v[i].first >> v[i].second;
    }

    int mid = (n+2)/3;

    int resp1 = INF, resp2 = INF, resp3 = INF;

    for(int i=0; i<(1<<mid); i++){
        int sum = 0, sum2 = 0;
        for(int j=0; j<mid; j++){
            if(i & (1<<j)) sum += v[j].first;
            else sum2+=v[j].second;
        }
        //cout << sum << ' ' << sum2 << endl;
        resp1 = min(resp1, max(sum, sum2));
    }
    for(int i=0; i<(1<<(max(0, min(2*mid, n) - mid))); i++){
        int sum = 0, sum2 = 0;
        for(int j=mid; j<min(2*mid, n); j++){
            if(i & (1<<(j-mid))) sum += v[j].first;
            else sum2+=v[j].second;
        }
        //cout << sum << ' ' << sum2 << endl;
        resp2 = min(resp2, max(sum, sum2));
    }

    for(int i=0; i<(1<<(max(0, n - 2*mid))); i++){
        int sum = 0, sum2 = 0;
        for(int j=2*mid; j<n; j++){
            if(i & (1<<(j-2*mid))) sum += v[j].first;
            else sum2+=v[j].second;
        }
        //cout << sum << ' ' << sum2 << endl;
        resp3 = min(resp3, max(sum, sum2));
    }
    
    cout << resp1+resp2+resp3 << endl;

    return 0;
}