#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; (i) < (int)(n); ++ (i))
#define REP3(i, m, n) for (int i = (m); (i) < (int)(n); ++ (i))
#define REP_R(i, n) for (int i = (int)(n) - 1; (i) >= 0; -- (i))
#define REP3R(i, m, n) for (int i = (int)(n) - 1; (i) >= (int)(m); -- (i))
#define ALL(x) ::std::begin(x), ::std::end(x)
using namespace std;


int solve(int n, const vector<int> & y) {
    int k = *max_element(ALL(y)) + 100;
    vector<int> cur(k, INT_MAX), prv;
    cur[0] = 0;
    for (int y_i : y) {
        cur.swap(prv);
        cur.assign(k, INT_MAX);
        int acc = INT_MAX;
        REP (z, k) {
            acc = min(acc, prv[z]);
            cur[z] = acc + abs(z - y_i);
        }
    }
    return *min_element(ALL(cur));
}

int main() {
    int n; cin >> n;
    vector<int> y(n);
    REP (i, n) {
        cin >> y[i];
    }
    auto ans = solve(n, y);
    cout << ans << endl;
    return 0;
}