#include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <bitset>
#include <iomanip>
#include <limits>
#include <chrono>
#include <random>
#include <array>
#include <unordered_map>
#include <functional>
#include <complex>
#include <numeric>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
constexpr long long MAX = 5100000;
constexpr long long INF = 1LL << 60;
constexpr int inf = 1000000007;
constexpr long long mod = 1000000007LL;
//constexpr long long mod = 998244353LL;
const long double PI = acos((long double)(-1));

using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;

int main()
{
	/*
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	*/
	ll n; scanf("%lld", &n);
	const ll offset = 10000;
	const ll mx = 30000;
	vector<vector<ll>> dp(n, vector<ll>(mx + 1, INF));
	vector<ll> y(n); for (int i = 0; i < n; i++) scanf("%lld", &y[i]), y[i] += offset;
	for (int i = 0; i <= mx; i++) dp[0][i] = llabs(i - y[0]);
	for (int i = 1; i < n; i++) {
		ll mn = INF;
		for (int j = 0; j <= mx; j++) {
			chmin(mn, dp[i - 1][j]);
			chmin(dp[i][j], mn + llabs(y[i] - j));
		}
	}
	ll res = INF;
	for (int i = 0; i <= mx; i++) chmin(res, dp[n - 1][i]);
	cout << res << endl;
	return 0;
}