#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
using namespace std;
#define N (1000000000+7)
#define M (998244353)
#define INF 1e16
typedef long long ll;
typedef pair<int,int> P;

const int MH = 10010;

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

    vector<ll>Y(n);
    for(int i=0;i<n;i++)cin>>Y[i];
    vector<vector<ll>>dp(n+1,vector<ll>(MH,INF));
    dp[0][0]=0;
    for(int i=0;i<n;i++){
        vector<ll>a(MH,INF);
        a[0] = dp[i][0];
        for(ll j=1;j<MH;j++)a[j] = min(a[j-1],dp[i][j]);
        for(ll j=0;j<MH;j++){
            ll cost = a[j]+abs(Y[i]-j);
            dp[i+1][j] = min(dp[i+1][j],cost);
        }
    }
    cout<<*min_element(dp[n].begin(),dp[n].end())<<endl;
}