#include <iostream>
#include <string>
#include <vector>
#include <climits>
#include <cmath>

using namespace std;

using ll = long long;

template <class T>
using grid = vector<vector<T>>;

#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)

#define input(...) __VA_ARGS__; in(__VA_ARGS__)

void print() {
  std::cout << std::endl;
}

template <class Head, class... Tail>
void print(Head&& head, Tail&&... tail) {
  std::cout << head << " ";
  print(std::forward<Tail>(tail)...);
}

void in() { }

template <class Head, class... Tail>
void in(Head&& head, Tail&&... tail) {
  cin >> head;
  in(std::forward<Tail>(tail)...);
}

int main() {

  ll input(n);
  vector<ll> y(n);
  REP(i, n) cin >> y[i];

  ll YMAX = 1000;
  vector<vector<ll>> table(n + 1);
  REP(i, n + 1) {
    if (i == n) table[i] = vector<ll>(YMAX + 1, 0);
    else table[i] = vector<ll>(YMAX + 1);
  }

  REPD(i, n) {
    FORD(h, YMAX, 0) {
      ll cost = LLONG_MAX;
      FOR(j, h, YMAX) {
        cost = min(cost, table[i + 1][j] + abs(y[i] - j));
      }
      table[i][h] = cost;
    }
  }

  print(table[0][0]);
}