import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Comparator;
import java.util.InputMismatchException;
import java.util.PriorityQueue;

public class Main {
    InputStream is;

    int __t__ = 1;
    int __f__ = 0;
    int __FILE_DEBUG_FLAG__ = __f__;
    String __DEBUG_FILE_NAME__ = "src/C3";

    FastScanner in;
    PrintWriter out;

    public void solve() {
        int N = in.nextInt();
        int[] l1 = new int[N];
        int[] r1 = new int[N];
        for (int i = 0; i < N; i++) {
            l1[i] = in.nextInt();
            r1[i] = in.nextInt();
        }
        System.out.println(Math.max(calc1(l1, r1), calc2(l1, r1)));
    }

    private long calc1(int[] L, int[] R) {
        int n = L.length;
        PriorityQueue<Pair> pq_up = new PriorityQueue<>(Comparator.comparingInt(p -> -p.l));
        PriorityQueue<Pair> pq_bottom = new PriorityQueue<>(Comparator.comparingInt(p -> p.r));
        boolean[] used = new boolean[n];
        for (int i = 0; i < n; i++) {
            pq_up.add(new Pair(i, L[i], R[i]));
            pq_bottom.add(new Pair(i, L[i], R[i]));
        }

        int cur = 0;
        long res = 0;
        for (int i = 0; i < (n + 1) / 2; i++) {
            while (!pq_up.isEmpty()) {
                Pair lp = pq_up.poll();
                if (used[lp.id]) continue;

                used[lp.id] = true;
                if (lp.l > cur) {
                    res += lp.l - cur;
                    cur = lp.l;
                }
                break;
            }
            while (!pq_bottom.isEmpty()) {
                Pair rp = pq_bottom.poll();
                if (used[rp.id]) continue;

                used[rp.id] = true;
                if (cur > rp.r) {
                    res += cur - rp.r;
                    cur = rp.r;
                }
                break;
            }
        }
        res += Math.abs(cur);
        return res;
    }


    private long calc2(int[] L, int[] R) {
        int n = L.length;
        PriorityQueue<Pair> pq_up = new PriorityQueue<>(Comparator.comparingInt(p -> -p.l));
        PriorityQueue<Pair> pq_bottom = new PriorityQueue<>(Comparator.comparingInt(p -> p.r));
        boolean[] used = new boolean[n];
        for (int i = 0; i < n; i++) {
            pq_up.add(new Pair(i, L[i], R[i]));
            pq_bottom.add(new Pair(i, L[i], R[i]));
        }

        int cur = 0;
        long res = 0;
        for (int i = 0; i < (n + 1) / 2; i++) {
            while (!pq_bottom.isEmpty()) {
                Pair rp = pq_bottom.poll();
                if (used[rp.id]) continue;

                used[rp.id] = true;
                if (cur > rp.r) {
                    res += Math.abs(cur - rp.r);
                    cur = rp.r;
                }
                break;
            }
            while (!pq_up.isEmpty()) {
                Pair lp = pq_up.poll();
                if (used[lp.id]) continue;

                used[lp.id] = true;
                if (lp.l > cur) {
                    res += lp.l - cur;
                    cur = lp.l;
                }
                break;
            }
        }
        res += Math.abs(cur);
        return res;
    }

    class Pair {
        final int id;
        final int l;
        final int r;

        public Pair(int id, int l, int r) {
            this.id = id;
            this.l = l;
            this.r = r;
        }

        @Override
        public String toString() {
            return "Pair{" +
                    "id=" + id +
                    ", l=" + l +
                    ", r=" + r +
                    '}';
        }
    }

    public void run() {
        if (__FILE_DEBUG_FLAG__ == __t__) {
            try {
                is = new FileInputStream(__DEBUG_FILE_NAME__);
            } catch (FileNotFoundException e) {
                e.printStackTrace();
            }
            System.out.println("FILE_INPUT!");
        } else {
            is = System.in;
        }
        in = new FastScanner(is);
        out = new PrintWriter(System.out);

        solve();
    }

    public static void main(String[] args) {
        new Main().run();
    }

    public void mapDebug(int[][] a) {
        System.out.println("--------map display---------");

        for (int i = 0; i < a.length; i++) {
            for (int j = 0; j < a[i].length; j++) {
                System.out.printf("%3d ", a[i][j]);
            }
            System.out.println();
        }

        System.out.println("----------------------------");
        System.out.println();
    }

    public void debug(Object... obj) {
        System.out.println(Arrays.deepToString(obj));
    }

    class FastScanner {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;

        public FastScanner(InputStream stream) {
            this.stream = stream;
            //stream = new FileInputStream(new File("dec.in"));

        }

        int read() {
            if (numChars == -1)
                throw new InputMismatchException();
            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }
                if (numChars <= 0)
                    return -1;
            }
            return buf[curChar++];
        }

        boolean isSpaceChar(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

        boolean isEndline(int c) {
            return c == '\n' || c == '\r' || c == -1;
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        int[] nextIntArray(int n) {
            int[] array = new int[n];
            for (int i = 0; i < n; i++)
                array[i] = nextInt();

            return array;
        }

        int[][] nextIntMap(int n, int m) {
            int[][] map = new int[n][m];
            for (int i = 0; i < n; i++) {
                map[i] = in.nextIntArray(m);
            }
            return map;
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        long[] nextLongArray(int n) {
            long[] array = new long[n];
            for (int i = 0; i < n; i++)
                array[i] = nextLong();

            return array;
        }

        long[][] nextLongMap(int n, int m) {
            long[][] map = new long[n][m];
            for (int i = 0; i < n; i++) {
                map[i] = in.nextLongArray(m);
            }
            return map;
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        double[] nextDoubleArray(int n) {
            double[] array = new double[n];
            for (int i = 0; i < n; i++)
                array[i] = nextDouble();

            return array;
        }

        double[][] nextDoubleMap(int n, int m) {
            double[][] map = new double[n][m];
            for (int i = 0; i < n; i++) {
                map[i] = in.nextDoubleArray(m);
            }
            return map;
        }

        String next() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            StringBuilder res = new StringBuilder();
            do {
                res.appendCodePoint(c);
                c = read();
            } while (!isSpaceChar(c));
            return res.toString();
        }

        String[] nextStringArray(int n) {
            String[] array = new String[n];
            for (int i = 0; i < n; i++)
                array[i] = next();

            return array;
        }

        String nextLine() {
            int c = read();
            while (isEndline(c))
                c = read();
            StringBuilder res = new StringBuilder();
            do {
                res.appendCodePoint(c);
                c = read();
            } while (!isEndline(c));
            return res.toString();
        }
    }
}


Measured memory_bytes: 60776