1

#include <iostream>

using namespace std;

const int N = 20;
int t1[N], t2[N], n, a[N], b[N], ans = 1000000000;

void dfs(int step)
{
    if (step > n)
    {
        int T1 = 0, T2 = 0;
        for (int j = 1; j <= n; j ++ )
        {
            T1 = T1 + t1[a[j]];
            if (T1 < T2) T2 = T2 + t2[a[j]];
            else T2 = T1 + t2[a[j]];
        }
        if (ans > T2) ans = T2;
        return;
    }
    for (int i = 1; i <= n; i ++ )
        if (b[i] == 0)
        {
            b[i] = 1;
            a[step] = i;
            dfs(step + 1);
            b[i] = 0;
        }
}

int main(void)
{
    cin >> n;
    for (int i = 1; i <= n; i ++ )
        cin >> t1[i] >> t2[i];
        
    dfs(1);
    
    cout << ans;
    return 0;
}