import sys
import pypyjit
import itertools
import heapq
import math
from collections import deque, defaultdict
import bisect

input = sys.stdin.readline
sys.setrecursionlimit(10 ** 6)
pypyjit.set_param('max_unroll_recursion=-1')


def index_lt(a, x):
    'return largest index s.t. A[i] < x or -1 if it does not exist'
    return bisect.bisect_left(a, x) - 1


def index_le(a, x):
    'return largest index s.t. A[i] <= x or -1 if it does not exist'
    return bisect.bisect_right(a, x) - 1


def index_gt(a, x):
    'return smallest index s.t. A[i] > x or len(a) if it does not exist'
    return bisect.bisect_right(a, x)


def index_ge(a, x):
    'return smallest index s.t. A[i] >= x or len(a) if it does not exist'
    return bisect.bisect_left(a, x)


N = int(input())
Y = list(map(int, input().split()))

L = 10000
dp = [[None for _ in range(L + 1)] for _ in range(N)]
for j in range(L + 1):
    dp[0][j] = abs(Y[0] - j)
for j in range(1, L + 1):
    dp[0][j] = min(dp[0][j], dp[0][j - 1])

for i in range(1, N):
    for j in range(L + 1):
        dp[i][j] = dp[i - 1][j] + abs(Y[i] - j)
    for j in range(1, L + 1):
        dp[i][j] = min(dp[i][j], dp[i][j - 1])
print(min(dp[N - 1]))