#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <algorithm>
#include <cmath>
#include <string>
#include <cstring>
#include <map>
#include <set>
#include <bitset>
#include <sstream>
#include <cstdlib>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <random>
#include <functional>
#include <climits>
#include <cstdio>
#include <ctype.h>
#include <time.h>
using namespace std;

#define PI acos(-1.0)
#define EPS 1e-8
#define MOD 1000000007
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define fi first
#define se second
#define go(i, a, b) for(int i = a; i <= b; ++i)
#define gorev(i, a, b) for(int i = a; i >= b; --i)

typedef long double ld;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;

template <class L, class R> ostream &operator <<(ostream &os, pair<L, R> P){
    return os << "(" << P.fi << "," << P.se << ")";
}
template <class T> ostream &operator <<(ostream &os, vector<T> V){
    os << "["; for (auto vv: V) os << vv << ","; return os << "]";
}
template <class L, class R> ostream &operator <<(ostream &os, map<L, R> M){
    os << "["; for (auto pr: M) os << pr.fi << "->" << pr.se << ","; return os << "]";
}
template <class L, class R> ostream &operator <<(ostream &os, unordered_map<L, R> M){
    os << "["; for (auto pr: M) os << pr.fi << "->" << pr.se << ","; return os << "]";
}

mt19937_64 mt(time(0));

struct Matrix {
    vvi data;
    int r, c;
    Matrix(int row, int col, bool identity = false) : r(row), c(col) {
        data.assign(row, vector<int>(col, 0));
        if (identity) {
            for (int i = 0; i < r; ++i) {
                data[i][i] = 1;
            }
        }
    }
    Matrix operator * (Matrix& other) {
        int m = r, n = c, p = other.c;
        Matrix res(m, p);
        for (int i = 0; i < m; ++i) {
            for (int j = 0; j < p; ++j) {
                for (int k = 0; k < n; ++k) {
                    res.data[i][j] += data[i][k] * other.data[k][j];
                }
            }
        }
        return res;
    }
};

vector<int> extendGcd(int a, int b) {
    if (b == 0) {
        return {1, 0, a};
    } else {
        vector<int> tmp = extendGcd(b, a % b);
        return {tmp[1], tmp[0] - (a / b) * tmp[1], tmp[2]};
    }
}

Matrix matrix_power(Matrix base, ll exp) {
    int n = base.r;
    Matrix res(n, n, true);
    while (exp) {
        if (exp & 1) {
            res = res * base;
        }
        base = base * base;
        exp >>= 1;
    }
    return res;
}

/******************************** template ********************************/
#define N 100010
int n;
pii le[N], ri[N];
int lind, rind;
map<pii, int> cnt;

void init() {
    lind = rind = 0;
    go(i, 0, n - 1) cnt[le[i]]++;
}

bool cmpfi(pii a, pii b) {
    return a.fi > b.fi;
}

bool cmpse(pii a, pii b) {
    return a.se < b.se;
}

ll solve(int cur, bool right) {
    int l, r;
    if (right) {
        while (rind < n && cnt.find(ri[rind]) == cnt.end()) {
            ++rind;
        }
        if (rind == n) {
            return abs(cur);
        }
        l = ri[rind].fi;
        r = ri[rind].se;
        if (--cnt[ri[rind]] == 0) {
            cnt.erase(ri[rind]);
            ++rind;
        }
    } else {
        while (lind < n && cnt.find(le[lind]) == cnt.end()) {
            ++lind;
        }
        if (lind == n) {
            return abs(cur);
        }
        l = le[lind].fi;
        r = le[lind].se;
        if (--cnt[le[lind]] == 0) {
            cnt.erase(le[lind]);
            ++lind;
        }
    }

    if (l > cur) {
        return l - cur + solve(l, !right);
    } else if (r < cur) {
        return cur - r + solve(r, !right);
    } else {
        return solve(cur, !right);
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cout.precision(10);
    cout << fixed;
#ifdef ZYC_LOCAL
    freopen("input.txt", "rt", stdin);
#endif
    cin >> n;
    int l, r;
    int left = 0, right = 0;
    go(i, 0, n - 1) {
        cin >> l >> r;
        le[i] = ri[i] = {l, r};
        if (l > 0) {
            right++;
        } else if (r < 0) {
            left++;
        }
    }
    sort(le, le + n, cmpfi);
    sort(ri, ri + n, cmpse);

    init();
    ll res = solve(0, true);
    init();
    res = max(res, solve(0, false));
    cout << res;

#ifdef ZYC_LOCAL
    cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
    return 0;
}


Measured memory_bytes: 15872