// Slower C++ solution:
#include <bits/stdc++.h>

#define N 100007

#define inf 999999999

using namespace std;



long long mem[N];

long long ara[N];

int n;



long long dp(int i, int j)

{

    if(i >= n)

        return inf;

    if(i == j)

        return 0;

    if(mem[i] != -1)

        return mem[i];

    long long ans = min(abs(ara[i + 1] - ara[i]) + dp(i + 1, j), abs(ara[i + 2] - ara[i]) + dp(i + 2, j));

    mem[i] = ans;

    return ans;

}

int main()

{

    //freopen("input.txt", "r", stdin);

    //freopen("output.txt", "w", stdout);

    cin >> n;

    for(int i = 0;i < n;i++)

        cin >> ara[i];

    memset(mem, -1, sizeof(mem));

    cout << dp(0, n - 1) << endl;

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 1.7821800801896333x):
/*****************************************************************\

IN THE NAME OF ALLAH, MOST GRACIOUS AND MOST MERCIFUL

|                                                                 |

|     Author     : Mahabub Rahman                                 |

|     Email      : mahabubrahman618@gmail.com                     |

|     University : Comilla University, Bangladesh                 |

|                  Department of Computer Science & Engineering   |

\*****************************************************************/





/*...................................Data_Types............................................*/

#include<bits/stdc++.h>



using namespace std;

#define FastIO ios::sync_with_stdio(false); cin.tie(0);cout.tie(0)

#define       ll                  long long int

#define       ull                  unsigned long long int

#define       veci                 vector<int>

#define       vecc                 vector<char>

#define       vecs                 vector<string>

#define       vecl                 vector<long long int>

#define       vecp                 vector<  pair<int,int> >

#define       mapstrint            map< string , int >

#define       mapstrstr            map< string , string >

#define       mapint               map< int, int >

#define       pb                   push_back

#define       newline cerr << endl

#define       pob                  pop_back

#define       mp                   make_pair

#define       pii                  pair<int, int>

#define       F                    first

#define       S                    second

#define       sc(x)                scanf("%d",&x)

#define       sc2(xx,zz)           scanf("%d %d",&xx,&zz)

#define       scl(x)               scanf("%lld",&x)

#define       scl2(xx,zz)          scanf("%lld %lld",&xx,&zz)

#define       pf                   printf

#define       min3(a,b,c)          min(a,b<c?b:c)

#define       max3(a,b,c)          max(a,b>c?b:c)

#define       all(v)               v.begin(), v.end()

///=============== Debugging ============================///

#define       debug(x) cerr << #x << " = " << x << endl

#define       debug2(x, y)             cerr << #x << ": " << x << " | " << #y << ": " << y << endl;

#define       debug3(x, y, z)          cerr << #x << ": " << x << " | " << #y << ": " << y << " | " << #z << ": " << z << endl;

#define       debug4(a, b, c, d)       cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " << c << " | " << #d << ": " << d << endl;

//#define f(x) (64 - __builtin_clzll(x))

///============ CONSTANT ===============///

#define mx9   1000000007

#define mx7   10000007

#define mx6   2000006

#define mx5   200005

#define inf   1<<30                                           //infinity value

#define eps   1e-9

#define mod   mx9

///==============================TEMPLATES===============================///



long double PI = acosl(-1);

bool compare_int(int a, int b){return (a>b);} //This function is use for descending order.

bool compare_string (string a, string b){return a.size()<b.size();}

bool compare_pair(const pair<int,int> &a,

                    const pair<int,int> &b){if(a.second==b.second)return a.first<b.first; else return (a.second > b.second);}

bool cmp(pair<string ,int > x , pair<string ,int > y){return (x.S < y.S);}

///=====================Graph Moves================///

//const int fx[]= {+1,-1,+0,+0};

//const int fy[]= {+0,+0,+1,-1};

//const int fx[]={+0,+0,+1,-1,-1,+1,-1,+1};   // Kings Move

//const int fy[]={-1,+1,+0,+0,+1,+1,-1,-1};  // Kings Move

//const int fx[]={-2, -2, -1, -1,  1,  1,  2,  2};  // Knights Move

//const int fy[]={-1,  1, -2,  2, -2,  2, -1,  1}; // Knights Move



///=====================Bitmask===================///

//int Set(int N,int pos){return N=N | (1<<pos);}

//int reset(int N,int pos){return N= N & ~(1<<pos);}

//bool check(int N,int pos){return (bool)(N & (1<<pos));}



///========================================FUNCTION=========================================///

//bool check(int n){if(n==1) return false; for(int i=2; i*i<=n; i++){if(n%i==0) return false;} return true;}

//ll bigmod(ll a, ll b, ll m){if(b==0) return 1%m;ll x=bigmod(a, b/2, m);x=(x*x)%m;if(b%2==1)x=(x*a)%m;return x;}

//bool flag[mx5];veci prime;

//void sieve(){prime.pb(2);for(ll i=3; i*i<=mx5; i+=2){if(flag[i]) continue;for(ll j=i*i; j<=mx5; j+=i+i) flag[j]=true;}for(ll i=3; i<=mx5; i+=2) if(!flag[i]) prime.pb(i);}

//ll fact(ll n){if(n==0 or n==1)return 1; else return n*fact(n-1);}

void NA(){printf("NO\n");exit(0);}

void YA(){printf("YES\n");exit(0);}



///=================START_FROM_HERE=====================///



int32_t main()

{

    ///Don't see test case until get 7/8 times wrong submission..!!

    ///Try to make Corner, Even, Odd or Prime case..!!

    FastIO;

    int n;

    cin >> n;

    int a[n+1], ans[n+2]={0};

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

    for(int i=n-2; i>=0; i--)

    {

        if(i==n-2)

        {

            ans[i]= abs(a[i]-a[i+1]);

            continue;

        }

        ans[i] = min(abs(a[i]-a[i+1])+ans[i+1], abs(a[i]-a[i+2])+ans[i+2]);

    }

    cout << ans[0] << endl;



}

///Created: