#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("YES");}else{puts("NO");}
#define MAX_N 200005

int main() {
    int n;
    cin >> n;

    int y[n];
    rep(i,n)cin >> y[i];

    int dp[n][10001];
    rep(i,n)rep(j,10001)dp[i][j] = 1001001001;

    rep(i,n){
        if(i == 0){
            rep(j,10001) dp[i][j] = abs(j - y[i]);
        }else{
            int mi = 1001001001;
            rep(j,10001){
                mi = min(mi, dp[i-1][j]);
                dp[i][j] = mi + abs(j - y[i]);
            }
        }
    }

    int ans = 1001001001;
    rep(i,10001) ans = min(ans, dp[n-1][i]);
    cout << ans << endl;
    return 0;
}