#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define IFOR(i, m, n) for (ll i = n - 1; i >= m; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
#define FOREACH(x, a) for (auto&(x) : (a))
#define ALL(v) (v).begin(), (v).end()
#define SZ(x) ll(x.size())

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

int main() {
  ll n;
  cin >> n;
  vector<ll> a(n);
  REP(i, n) { cin >> a[i]; }
  const ll A_MAX = 1e4, INF = 1e18;
  vector<vector<ll>> dp(2, vector<ll>(A_MAX + 1, INF)),
      mini(2, vector<ll>(A_MAX + 1, 0));

  dp[0][0] = 0;

  REP(i, n) {
    ll ci = i % 2, ni = !ci;
    REP(j, A_MAX + 1) { chmin(dp[ni][j], mini[ci][j] + abs(a[i] - j)); }

    REP(j, A_MAX + 1) {
      mini[ci][j] = INF;
      dp[ci][j] = INF;
    }
    mini[ni][0] = dp[ni][0];
    FOR(j, 1, A_MAX + 1) { mini[ni][j] = min(mini[ni][j - 1], dp[ni][j]); }
  }

  ll ans = INF;
  REP(i, A_MAX + 1) { ans = min(ans, dp[n % 2][i]); }
  cout << ans << endl;
}