#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#include<bitset>
#include<limits.h>
#include<cassert>
#include<iterator>
#include<complex>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<time.h>
#include<random>
#include<array>
using namespace std;
using ll = long long;
#define rep(i, a, b) for(int i = a; i < b; i++)
#define rrep(i, a, b) for(int i = b - 1; i >= a; i--)
#define ALL(a) a.begin(), a.end()
using pii = pair<int,int>;
using piii = pair<pii,int>;
using pll = pair<long long, long long>;
using plll = pair<pll, long long>;
// #pragma GCC optimize("Ofast")
#define pcnt __builtin_popcount
#define buli(x) __builtin_popcountll(x)
#define pb push_back
#define mp make_pair
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define isSquare(x) (sqrt(x)*sqrt(x) == x)
template<class T>bool chmax(T &a, const T &b) {if(a<b){a = b; return 1;} return 0; };
template<class T>bool chmin(T &a, const T &b) {if(a>b){a = b; return 1;} return 0; };
inline void in(void){return;}
template <typename First, typename... Rest> void in(First& first, Rest&... rest){cin >> first;in(rest...);return;}
inline void out(void){cout << "\n";return;}
template <typename First, typename... Rest> void out(First first, Rest... rest){cout << first << " ";out(rest...);return;}
const double EPS = 1e-9;
const int mod = 1e9 + 7;
const int INF = 1e9;
const long long INFLL = 1e18;
void iosetup() {
    cin.tie(nullptr);ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
}
template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 >& p) {
    os << p.first << " " << p.second;
    return os;
}
template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
    is >> p.first >> p.second;
    return is;
}
template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
    for(int i = 0; i < (int) v.size(); i++) {
        os << v[i] << (i + 1 != v.size() ? " " : "");
    }
    return os;
}
template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
    for(T &in : v) is >> in;
    return is;
}
template<class S, class T> pair<S,T> operator+(const pair<S,T> &s, const pair<S, T>& t){return pair<S,T>(s.first+t.first, s.second+t.second);}
template<class S, class T> pair<S,T> operator-(const pair<S,T> &s, const pair<S, T>& t){return pair<S,T>(s.first-t.first, s.second-t.second);}
template<class S, class T> pair<S,T> operator*(const pair<S,T> &s, const S& t){return pair<S,T>(s.first*t, s.second*t);}
template <typename T> void Exit(T first){cout << first << endl;exit(0); };
template< int mod > struct ModInt {
    unsigned x; ModInt() : x(0) {}
    ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
    ModInt &operator+=(const ModInt &p) {if((x += p.x) >= mod) x -= mod;return *this;}
    ModInt &operator-=(const ModInt &p) {if((x += mod - p.x) >= mod) x -= mod;return *this;}
    ModInt &operator*=(const ModInt &p) {x = (int) (1LL * x * p.x % mod);return *this;}
    ModInt &operator/=(const ModInt &p) {*this *= p.inverse();return *this;}
    ModInt operator-() const { return ModInt(-x); }
    ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
    ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
    ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
    ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
    bool operator==(const ModInt &p) const { return x == p.x; }
    bool operator!=(const ModInt &p) const { return x != p.x; }
    ModInt inverse() const {int a = x, b = mod, u = 1, v = 0, t;
    while(b > 0) { t = a / b; swap(a -= t * b, b); swap(u -= t * v, v); }return ModInt(u);}
    ModInt pow(int64_t n) const {ModInt ret(1), mul(x); while(n > 0) {if(n & 1) ret *= mul;mul *= mul;n >>= 1;}return ret;}
    friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x;}
    friend istream &operator>>(istream &is, ModInt &a) { int64_t t; is >> t; a = ModInt< mod >(t); return (is); }
    static int get_mod() { return mod; }
}; using modint = ModInt< mod >;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const pii dxy[4] = {pii(1,0), pii(0, 1), pii(-1, 0), pii(0, -1)};
const int calender[13] = {0, 31,28,31,30,31,30,31,31,30,31,30,31};
const int ucalender[13] = {0, 31,29,31,30,31,30,31,31,30,31,30,31};
bool range(int a, int b, int x){if(a <= x and x < b)return true;else return false;}
bool range(int a, int b, int c, int d, pii p){if(a <= p.first and p.first < b and c <= p.second and p.second < d) return true;else return false;}


int main(){
    iosetup();
    int N; cin >> N;
    vector<piii> P(N);
    vector<piii> RP(N);
    rep(i, 0, N){
        cin >> P[i].first.first >> P[i].first.second; P[i].second = i;
        // if(P[i].second < 0) A.emplace_back(P[i]);
        // else if(P[i].first > 0) B.emplace_back(P[i]);
        // else C.emplace_back(P[i]);
    }
    // if(A.size() > B.size())
    RP = P;
    // cerr << P << endl;
    sort(ALL(P), [](piii a, piii b){
        return a.first.first > b.first.first;
    });
    sort(ALL(RP), [](piii a, piii b){
        return a.first.second < b.first.second;
    });
    ll ans = 0;
    vector<bool> used(N, false);
    int idx = 0, ridx = 0;
    int now = 0;
    ll tmp = 0, cnt = 0;
    rep(i, 0, N){
        while(idx < N and used[P[idx].second]) idx++;
        if(P[idx].first.first <= now and now <= P[idx].first.second);
        else{
            if(now < P[idx].first.first){
                tmp += P[idx].first.first - now;
                now = P[idx].first.first;
            }else{
                tmp += now - P[idx].first.second;
                now = P[idx].first.second;
            }
        }
        used[P[idx].second] = true;
        idx++; cnt++;
        // cerr << now << endl;
        if(cnt >= N) break;
        while(ridx < N and used[RP[ridx].second]) ridx++;
        if(RP[ridx].first.first <= now and now <= RP[ridx].first.second);
        else{
            if(now < RP[ridx].first.first){
                tmp += RP[ridx].first.first - now;
                now = RP[ridx].first.first;
            }else{
                tmp += now - RP[ridx].first.second;
                now = RP[ridx].first.second;
            }
        }
        used[RP[ridx].second] = true;
        ridx++;cnt++;
        // cerr << now << endl;
        if(cnt >= N) break;
    }
    // cerr << tmp + abs(now) << endl;
    chmax(ans, tmp + abs(now));
    idx = 0, ridx = 0;
    now = 0;
    used.assign(N, false);
    tmp = 0, cnt = 0;
    rep(i, 0, N){
        while(ridx < N and used[RP[ridx].second]) ridx++;
        if(RP[ridx].first.first <= now and now <= RP[ridx].first.second);
        else{
            if(now < RP[ridx].first.first){
                tmp += RP[ridx].first.first - now;
                now = RP[ridx].first.first;
            }else{
                tmp += now - RP[ridx].first.second;
                now = RP[ridx].first.second;
            }
        }
        used[RP[ridx].second] = true;
        ridx++;cnt++;
        if(cnt >= N) break;
        while(idx < N and used[P[idx].second]) idx++;
        if(P[idx].first.first <= now and now <= P[idx].first.second);
        else{
            if(now < P[idx].first.first){
                tmp += P[idx].first.first - now;
                now = P[idx].first.first;
            }else{
                tmp += now - P[idx].first.second;
                now = P[idx].first.second;
            }
        }
        used[P[idx].second] = true;
        idx++; cnt++;
        if(cnt >= N) break;
    }
    // cerr << tmp + abs(now) << endl;
    chmax(ans, tmp + abs(now));
    cout << ans << endl;
    return 0;
}

Measured memory_bytes: 2560