#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//

int A[1000];
int dp[1000];

int main() {
	int N;
	cin >> N;
	REP(i, N) scanf("%d", &A[i]);
	
	auto compress = [](auto &&v, auto &&cv) -> void {
		for (auto &&u : v) cv.emplace_back(u);
		std::sort(std::begin(cv), std::end(cv));
		cv.erase(std::unique(std::begin(cv), std::end(cv)), std::end(cv));
		for (auto &&u : v) u = std::lower_bound(std::begin(cv), std::end(cv), u) - std::begin(cv);
	};
	
	vector<int> cx;
	compress(A, cx);
	
	REP(i, cx.size()) dp[i] = abs(cx[A[0]] - cx[i]);
	FOR(i, 1, N) {
		int mn = INF;
		REP(j, cx.size()) {
			chmin(mn, dp[j]);
			dp[j] = mn + abs(cx[j] - cx[A[i]]);
		}
	}
	
	cout << *min_element(dp, dp + cx.size()) << endl;
}