#include <iostream>
#include <string>
#include <algorithm>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
int dp[1010][10100] = {};
int y[10100];
int main() {
	int n;
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> y[i];
	}
	for (int i = 1; i <= n; i++) {
		int m = 1000000007;
		for (int j = 0; j <= 10010; j++) {
			dp[i][j] += abs(y[i] - j);
			if (m > dp[i - 1][j]) {
				m = dp[i - 1][j];
			}
			dp[i][j] += m;
		}
	}
	int ans = 1000000007;
	for (int i = 0; i <= 10010; i++) {
		if (ans > dp[n][i]) {
			ans = dp[n][i];
		}
	}
	cout << ans << endl;
}