#include<cstdio>

#include<cstring>

#include<algorithm>

#include<ctime>

using namespace std;

int rdn()

{

  int ret=;bool fx=;char ch=getchar();

  while(ch>''||ch<''){if(ch=='-')fx=;ch=getchar();}

  while(ch>=''&&ch<='')ret=ret*+ch-'',ch=getchar();

  return fx?ret:-ret;

}

int Mn(int a,int b){return a<b?a:b;}

const int N=,M=1e9;

int n,rt,tot,vl[N],c[N][],rd[N],ans;

void rotate(int &cr,bool d)

{

  int v=c[cr][!d];

  c[cr][!d]=c[v][d]; c[v][d]=cr; cr=v;

}

void ins(int &cr,int k)

{

  if(!cr){cr=++tot; vl[cr]=k; rd[cr]=rand()%M; return;}

  int d;

  if(k<=vl[cr]) d=, ins(c[cr][],k);

  else d=, ins(c[cr][],k);

  if(rd[c[cr][d]]>rd[cr])rotate(cr,!d);

}

int fnd_pr(int cr,int k)

{

  if(!cr)return N;

  if(vl[cr]<=k)

    {

      int d=fnd_pr(c[cr][],k);

      return d==N?cr:d;

    }

  return fnd_pr(c[cr][],k);

}

int fnd_sc(int cr,int k)

{

  if(!cr)return N;

  if(vl[cr]>=k)

    {

      int d=fnd_sc(c[cr][],k);

      return d==N?cr:d;

    }

  return fnd_sc(c[cr][],k);

}

int main()

{

  srand(time()); n=rdn();

  for(int i=,d;i<=n;i++)

    {

      d=rdn();

      if(i==)ans=d;

      else

    {

      int u=fnd_pr(rt,d), v=fnd_sc(rt,d);

      if(u==N)ans+=vl[v]-d;

      else if(v==N)ans+=d-vl[u];

      else ans+=Mn(vl[v]-d,d-vl[u]);

    }

      ins(rt,d);

    }

  printf("%d\n",ans); return ;

}