#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>


void solve() {
    int n;
    cin >> n;

    vector<int> a(n + 1);
    for (int i = 1; i <= n; i++) cin >> a[i];

    auto get = [&] (vector<int> a)->ll {
        a[0] = -2e9;
        auto b = a; sort(b.begin(), b.end()); b.erase(unique(b.begin(), b.end()), b.end());

        vector dp(n + 1, vector<ll>(b.size(), 2e18));
        dp[0][0] = 0;
        for (int i = 1; i < b.size(); i++) dp[0][i] = min(dp[0][i], dp[0][i - 1]);

        for (int i = 1; i <= n; i++) {
            for (int j = 0; j < b.size(); j++) {
                dp[i][j] = min(dp[i][j], dp[i - 1][j] + abs(a[i] - b[j]));
                if (j >= 1) dp[i][j] = min(dp[i][j], dp[i][j - 1]);
            }
        }
        return dp[n][(int)b.size() - 1];
    };

    auto ans = get(a);
    for (int i = 1; i <= n; i++) a[i] = -a[i];
    ans = min(ans, get(a));
    cout << ans << '\n';
}
signed main() {
    ios::sync_with_stdio(0); cin.tie(0);
    int t = 1;
    // cin >> t;
    while (t--) solve();
    return 0;
}
/*
g++ -std=c++20 1.cpp -o 1 && 1 < in.txt > out.txt
*/