def dist(i, j):
    Xi, Yi = XY[i]
    Xj, Yj = XY[j]
    return abs(Xi - Xj) + abs(Yi - Yj)


def waste(i, j, k):
    Xi, Yi = XY[i]
    Xj, Yj = XY[j]
    Xk, Yk = XY[k]
    ret = 0
    if (Xj - Xi) * (Xk - Xi) > 0:
        ret += min(abs(Xj - Xi), abs(Xk - Xi))
    if (Yj - Yi) * (Yk - Yi) > 0:
        ret += min(abs(Yj - Yi), abs(Yk - Yi))
    return ret


N = int(input())
XY = [(0, 0)]
for _ in range(N):
    X, Y = map(int, input().split())
    XY.append((X, Y))

INF = 10**18
dp = [[INF] * (N + 1) for _ in range(N + 1)]

for i in range(1, N + 1):
    dp[i][i] = dist(0, i)

for length in range(1, N):
    for i in range(1, N - length + 1):
        j = i + length
        for k in range(i, j):
            dp[i][j] = min(dp[i][j], dp[i][k] + dp[k + 1][j] - waste(0, i, j))

print(dp[1][N])
# for i in range(1, N + 1):
#     for j in range(i, N + 1):
#         print(i, j, dp[i][j])