#include <cstdio>
#include <vector>
#include <utility>
#include <algorithm>

using namespace std;

const int MAXN = 256;
const int INF = 2000000000;

int N;
vector<pair<int, int> > P;

int cache[2][MAXN][MAXN];

int fun(int d, int l, int r) {
    if (l > r) return 0;
    if (l == r) {
        return P[l].second;
    }
    if (cache[d][l][r] > -1) return cache[d][l][r];

    int &sol = cache[d][l][r];
    sol = INF;
    for (int i = l; i <= r; ++i) {
        int tmp;
        if (d == 0) {
            tmp = P[i].first - P[l].first + 2 * P[i].second;
        } else {
            tmp = P[r].first - P[i].first + 2 * P[i].second;
        }

        int left = fun(1, l, i - 1);
        if (i > l) left += P[i].first - P[i - 1].first;

        int right = fun(0, i + 1, r);
        if (i < r) right += P[i + 1].first - P[i].first;

        left += tmp;
        right += tmp;

        if (sol > max(left, right)) {
            sol = max(left, right);
        }
    }

//    printf("%d %d %d = %d\n", d, l, r, sol);
    return sol;
}

int main() {
    int x, y;
    freopen("wanted.in", "rt", stdin);
    freopen("wanted.out", "wt", stdout);

    scanf("%d", &N);
    P.reserve(N);
    for (int i = 0; i < N; ++i) {
        scanf("%d %d", &x, &y);
        P.push_back(make_pair(x, y));
    }
    sort(P.begin(), P.end());

    int sol = INF;
    for (int d = 0; d < 2; ++d)
        for (int i = 0; i < N; ++i)
            for (int j = 0; j < N; ++j)
                cache[d][i][j] = -10;

    for (int i = 0; i < N; ++i) {
        int tmp = abs(P[i].first) + 2 * P[i].second;
        int left = fun(1, 0, i - 1);
        if (i > 0) left += P[i].first - P[i - 1].first;
        int right = fun(0, i + 1, N - 1);
        if (i < N - 1) right += P[i + 1].first - P[i].first;

        left += tmp;
        right += tmp;

        if (sol > max(left, right)) {
//            printf("%d %d %d %d\n", i, tmp, left, right);
            sol = max(left, right);
        }
    }
    printf("%d\n", sol);
    return 0;
}