#include<bits/stdc++.h>
using namespace std;
int n;
const int N = 33000;
int arr[N];
int res;
vector <int> q;
int main()
{
    scanf("%d",&n);
    for(int i = 1;i <= n;i ++)
    {
        scanf("%d",&arr[i]);
    }
    for(int i = 1;i <= n;i ++)
    {
        q.clear();
        if(i == 1)res += arr[i];
        else if(i == 2)res += abs(arr[i] - arr[1]);
        else 
        {
            for(int j = 1;j < i;j ++)q.push_back(arr[j]);
            //二分查找
            sort(q.begin(),q.end());
            int l = -1,r = q.size();
            while(l  < r)
            {
                int mid = (l + r) >> 1;
                if(q[mid] < arr[i])l = mid;
                else r = mid  + 1;
            }
            if(l == -1)res += abs(arr[i] - q[r]);
            else if(r == q.size())res += abs(arr[i] - q[l]); 
            else res += min(abs(arr[i] - q[l]),abs(arr[i] - q[r]));
        }
    }
    printf("%d\n",res);
    return 0;
}