#include <bits/stdc++.h>
#include <iomanip>
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;

ll N,M,H,W,Q,K,A,B;
string S;
const ll MOD = 998244353;
//const ll MOD = (1e+9) + 7;
typedef pair<ll, ll> P;
const ll INF = (1LL<<62);

template<class T> bool chmin(T &a, const T &b){
    if(a > b) {a = b; return true;}
    else return false;
}
template<class T> bool chmax(T &a, const T &b){
    if(a < b) {a = b; return true;}
    else return false;
}

int main() {
    cin>>N;
    vec y(N);
    const int max_y = int(1e+4) + 1;
    mat dp(N, vec(max_y, INF));
    rep(i,N) {
        cin>>y[i];
    }
    rep(i,max_y) dp[0][i] = max(y[0] - i, 0LL);
    reps(i,1,N){
        rep(j,max_y){
            chmin(dp[i][j], dp[i-1][j] + abs(y[i] - j));
            if(j > 0) chmin(dp[i][j], dp[i][j-1]);
        }
    }
    cout<<dp[N - 1][max_y - 1]<<endl;
}