#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

const int N = 100010;
struct Node{
    int s[2],p,v;
    int size;
    
    void init(int _v,int _p)
    {
        v = _v, p = _p;
        size = 1;
    }
}tr[N];
int n,root,idx;

void pushup(int x)
{
    tr[x].size = tr[tr[x].s[0]].size + tr[tr[x].s[1]].size + 1;
}

void rotate(int x)
{
    int y = tr[x].p, z = tr[y].p;
    int k = tr[y].s[1] == x;
    tr[z].s[tr[z].s[1] == y] = x, tr[x].p = z;
    tr[y].s[k] = tr[x].s[k ^ 1],tr[tr[x].s[k ^ 1]].p = y;
    tr[x].s[k ^ 1] = y, tr[y].p = x;
    pushup(y),pushup(x);
}


void splay(int x,int k)
{
    while(tr[x].p != k)
    {
        int y = tr[x].p, z = tr[y].p;
        if(z != k) 
            if((tr[z].s[1] == y) ^ (tr[y].s[1] == x)) rotate(x);
            else rotate(y);
        rotate(x);
    }
    if(! k) root = x;
}

void insert(int v)
{
    int u = root, p = 0;
    while(u) p = u, u = tr[u].s[v > tr[u].v];
    u = ++ idx;
    tr[u].init(v,p);
    if(p) tr[p].s[v > tr[p].v] = u;
    splay(u, 0);
}

int get_pre(int x)
{
    int u = root,res = 0;
    while(u)
    {
        if(tr[u].v < x) res = max(tr[u].v, res), u = tr[u].s[1];
        else u = tr[u].s[0];
    }
    return res;
}

int get_suc(int x)
{
    int u = root,res = 1e8;
    while(u)
    {
        if(tr[u].v > x) res = min(tr[u].v, res), u = tr[u].s[0];
        else u = tr[u].s[1];
    }
    return res;
}

int main()
{
    scanf("%d",&n);
    int x,res = 0;
    scanf("%d",&x);
    n --; res = x; insert(x);
    
    while(n --)
    {
        scanf("%d",&x);
        insert(x);
        int t = get_pre(x),t2 = get_suc(x);
        int tmp = min(abs(t - x),abs(t2 - x));
        res += tmp;
    }
    printf("%d",res);
}