#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
template<class S, class T> inline S min_L(S a,T b){
  return a<=b?a:b;
}
inline int my_getchar_unlocked(){
  static char buf[1048576];
  static int s = 1048576;
  static int e = 1048576;
  if(s == e && e == 1048576){
    e = fread_unlocked(buf, 1, 1048576, stdin);
    s = 0;
  }
  if(s == e){
    return EOF;
  }
  return buf[s++];
}
inline void rd(int &x){
  int k;
  int m=0;
  x=0;
  for(;;){
    k = my_getchar_unlocked();
    if(k=='-'){
      m=1;
      break;
    }
    if('0'<=k&&k<='9'){
      x=k-'0';
      break;
    }
  }
  for(;;){
    k = my_getchar_unlocked();
    if(k<'0'||k>'9'){
      break;
    }
    x=x*10+k-'0';
  }
  if(m){
    x=-x;
  }
}
struct MY_WRITER{
  char buf[1048576];
  int s;
  int e;
  MY_WRITER(){
    s = 0;
    e = 1048576;
  }
  ~MY_WRITER(){
    if(s){
      fwrite_unlocked(buf, 1, s, stdout);
    }
  }
}
;
MY_WRITER MY_WRITER_VAR;
void my_putchar_unlocked(int a){
  if(MY_WRITER_VAR.s == MY_WRITER_VAR.e){
    fwrite_unlocked(MY_WRITER_VAR.buf, 1, MY_WRITER_VAR.s, stdout);
    MY_WRITER_VAR.s = 0;
  }
  MY_WRITER_VAR.buf[MY_WRITER_VAR.s++] = a;
}
inline void wt_L(char a){
  my_putchar_unlocked(a);
}
inline void wt_L(long long x){
  int s=0;
  int m=0;
  char f[20];
  if(x<0){
    m=1;
    x=-x;
  }
  while(x){
    f[s++]=x%10;
    x/=10;
  }
  if(!s){
    f[s++]=0;
  }
  if(m){
    my_putchar_unlocked('-');
  }
  while(s--){
    my_putchar_unlocked(f[s]+'0');
  }
}
template<class S, class T> inline S chmin(S &a, T b){
  if(a>b){
    a=b;
  }
  return a;
}
int N;
int A[1000];
long long dp[10001];
long long nx[10001];
int main(){
  int RZTsC2BF, i;
  long long mn;
  rd(N);
  {
    int Lj4PdHRW;
    for(Lj4PdHRW=(0);Lj4PdHRW<(N);Lj4PdHRW++){
      rd(A[Lj4PdHRW]);
    }
  }
  for(i=(1);i<(10001);i++){
    dp[i] = 4611686016279904256LL;
  }
  for(RZTsC2BF=(0);RZTsC2BF<(N);RZTsC2BF++){
    auto &k = A[RZTsC2BF];
    for(i=(0);i<(10001);i++){
      nx[i] = 4611686016279904256LL;
    }
    mn = 4611686016279904256LL;
    for(i=(0);i<(10001);i++){
      chmin(mn, dp[i]);
      nx[i] = mn + abs(i - k);
    }
    for(i=(0);i<(10001);i++){
      dp[i] = nx[i];
    }
  }
  {
    int hCmBdyQB;
    long long V9aVTaxx;
    if(10001==0){
      V9aVTaxx = 0;
    }
    else{
      V9aVTaxx = dp[0];
      for(hCmBdyQB=(1);hCmBdyQB<(10001);hCmBdyQB++){
        V9aVTaxx = min_L(V9aVTaxx, dp[hCmBdyQB]);
      }
    }
    wt_L(V9aVTaxx);
    wt_L('\n');
  }
  return 0;
}
// cLay varsion 20200509-1

// --- original code ---
// int N, A[1000];
// ll dp[10001], nx[10001];
// {
//   ll mn;
//   rd(N,A(N));
//   rep(i,1,10001) dp[i] = ll_inf;
// 
//   rep[A](k,N){
//     rep(i,10001) nx[i] = ll_inf;
//     mn = ll_inf;
//     rep(i,10001){
//       mn <?= dp[i];
//       nx[i] = mn + abs(i - k);
//     }
//     rep(i,10001) dp[i] = nx[i];
//   }
//   wt(min(dp(10001)));
// }