#include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using P = pair<ll, ll>;
const long double PI = acos(-1.0L);
ll GCD(ll a, ll b) { return b?GCD(b, a%b):a; }
ll LCM(ll a, ll b) { return a/GCD(a, b)*b; }

int dp[1010][10100];
const int INF = 1e9;

int main() {
    int n; cin >> n;
    vector<int> yvec(n, 0);
    for(int i = 0; i < n; ++i) cin >> yvec[i];
    for(int i = 0; i <= n; ++i) {
        for(int j = 0; j <= 10000; ++j) {
            dp[i][j] = INF;
        }
    }
    for(int i = 0; i <= 10000; ++i) dp[0][i] = 0;

    for(int i = 0; i < n; ++i) {
        int maxn = INF;
        for(int j = 0; j <= 10000; ++j) {
            chmin(maxn, dp[i][j]);
            chmin(dp[i+1][j], maxn + abs(yvec[i]-j));
        }
    }
    int ans = INF;
    for(int i = 0; i <= 10000; ++i) chmin(ans, dp[n][i]);
    cout << ans << endl;
}