import sys

sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LI2(): return list(map(int,sys.stdin.readline().rstrip()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
def LS2(): return list(sys.stdin.readline().rstrip())


N = I()
Y = [0]+LI()

dp = [[0]*12000 for _ in range(N+1)]
min_dp = [[0]*12000 for _ in range(N+1)]
# dp[i][j] = i番目の要素まで見て、最後の要素がjになるときの距離の総和の最小値
# min_dp[i][j] = i番目の要素まで見て、最後の要素がj以下になるときの距離の総和の最小値
for i in range(1,N+1):
    y = Y[i]
    for j in range(12000):
        dp[i][j] = min_dp[i-1][j]+abs(y-j)
        
    min_dp[i][0] = dp[i][0]
    a = dp[i][0]
    for j in range(1,12000):
        a = min(a,dp[i][j])
        min_dp[i][j] = a

ans = min_dp[-1][-1]
print(ans)