#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
using ll = long long;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;
const ll mod=998244353 ;
#define pai 3.141592653589793238462643383279





int main(){
  int N; cin >> N; int a[N];
  rep(i, N){
    cin >> a[i];
  }
  int dp[1010][10101] = {}; int mi;
  rep(i, 1010){
    rep(j, 10101){
      if(i==0) dp[i][j]=0;
      else dp[i][j]=inf;
    }
  }
  rep(i, N){
    int mi = inf;
    rep(j, 10100){
      dp[i+1][j] = min(mi, dp[i][j]) + abs(j-a[i]);
      mi = min(mi, dp[i][j]);
    }
  }
  int ans=inf;
  rep(i, 101010){
    ans = min(ans, dp[N][i]);
  }
  cout << ans << endl;
}