#include <bits/stdc++.h>
using namespace std;

const int N = 2e6 + 5, NN = 1e3 + 5;

int n;

struct Node{
    int s,t;
}a[N];

long long f[N];

int g[NN][NN];

int main(){
    cin >> n;
    for (int i = 1;i <= n;i++)
        scanf("%d%d",&a[i].t,&a[i].s);
    if (n > 1000){
        int ma = 0;
        for (int i = 1;i <= n;i++)
            ma = max(ma,a[i].s);
        long long ans = a[n].t + 2ll * ma;
        cout << ans;
        return 0;
    }
    for (int i = 1;i <= n;i++){
        g[i][i] = a[i].s;
        for (int j = i + 1;j <= n;j++)
            g[i][j] = max(g[i][j - 1],a[j].s);
    }
    for (int i = 1;i <= n;i++) f[i] = LONG_LONG_MAX;
    for (int i = 1;i <= n;i++){
        for (int j = 1;j <= i;j++){
            f[i] = min(f[i],max(f[j - 1],1ll * a[i].t) + g[j][i] * 2);
            // cout << j << ' ' << i << ':' << g[j][i] << '\n';
        }
    }
    cout << f[n];
    return 0;
}