#include <bits/stdc++.h>

using namespace std;

#define rep(i, n) for(int i = 0; i < (int)n; ++i)
#define FOR(i, a, b) for(int i = a; i < (int)b; ++i)
#define rrep(i, n) for(int i = ((int)n - 1); i >= 0; --i)

using ll = long long;
using ld = long double;

const ll INF = 1e18;
const int Inf = 1e9;
const double EPS = 1e-9;
const int MOD = 1e9 + 7;
const int N = 10001;

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(0);
    int n;
    cin >> n;
    vector<int> a(n);
    rep (i, n) cin >> a[i];
    vector<vector<int> > dp(n + 1, vector<int>(N, Inf));
    rep (i, N) {
        dp[0][i] = abs(a[0] - i);
    }
    FOR (i, 1, n) {
        int mi = Inf;
        rep (j, N) {
            mi = min(mi, dp[i - 1][j]);
            dp[i][j] = mi + abs(a[i] - j);
        }
    }
    int res = Inf;
    rep (i, N) res = min(res, dp[n - 1][i]);
    cout << res << endl;
    
    return 0;
}