import java.util.*;
public class joi2019_ho_t4 {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int N = scanner.nextInt();
int[][] coins = new int[2 * N][2];
for (int i = 0; i < 2 * N; i++) {
coins[i][0] = scanner.nextInt();
coins[i][1] = scanner.nextInt();
}
int[][] targets = new int[2 * N][2];
for (int i = 0; i < N; i++) {
targets[i][0] = i + 1;
targets[i][1] = 1;
targets[i + N][0] = i + 1;
targets[i + N][1] = 2;
}
Arrays.sort(coins, (a, b) -> a[0] != b[0] ? a[0] - b[0] : a[1] - b[1]);
Arrays.sort(targets, (a, b) -> a[0] != b[0] ? a[0] - b[0] : a[1] - b[1]);
long totalOperations = 0;
for (int i = 0; i < 2 * N; i++) {
totalOperations += Math.abs(coins[i][0] - targets[i][0]) + Math.abs(coins[i][1] - targets[i][1]);
}
System.out.println(totalOperations);
}
}
