#include<iostream>
#include<algorithm>
#include<set>
using namespace std;
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    set<long long>a;
    a.insert(1000001);
    a.insert(-1000001);
    long long n, i, ans = 0;
    cin >> n;
    for (long long j = 0; j < n; ++j)
    {
        cin >> i;
        if (a.size() == 2)
        {
            ans += i;
            a.insert(i);
        }
        else
        {
            auto iter = a.lower_bound(i);
            if (*iter != i)
            {
                auto iter2 = iter;
                iter2--;
                ans += min(abs(i - *iter2), abs(*iter - i));
                a.insert(i);
            }
        }
    }
    cout << ans;
    return 0;
}

近乎崩溃