// Slower C++ solution:
#include<iostream>

#include<cstring>

#include<algorithm>





using namespace std;



const long long inf= 1e10+ 123;

const int mx=1e5+123;

int dp[mx], h[mx], n;



int solve( int i)

{

    if(i==n)

        return 0;



    if(dp[i]!= -1)

        return dp[i];



    int ret1, ret2;

    ret1= abs(h[i]- h[i+1])+ solve(i+1);

    if(i+2<=n)

        ret2= abs(h[i]- h[i+2])+ solve(i+2);

    else

        ret2= inf;

    return dp[i]=min(ret1, ret2);

}



int main()

{

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



    cin>> n;

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

        cin>> h[i];



    cout<< solve(1)<< endl;



    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 1.3894140351964854x):
////=====BIsmillahir Rahmanir Rahim =====////



/*                        ______

 _______   /\     |``\   |        |  /

    |     /  \    |__/   |____    |/

    |    / _ _\   |  \   |        |\

    |   /      \  |   \  |______  |  \



            Dept. of CSE

         Comilla University



*/

#include<bits/stdc++.h>

#include <ext/pb_ds/assoc_container.hpp>

#include <ext/pb_ds/tree_policy.hpp>

#include <ext/pb_ds/detail/standard_policies.hpp>

#define fi 2*acos(0.0)

#define ee 2.71828

#define ll  long long

#define FIO ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);

#define Node struct node

#define spc " "

#define  E  2.71828182845904523536

#define pb push_back

#define pp pop_back

#define ff first

#define ss second

#define valid(nx,ny) nx>=0 && nx<n && ny>=0 && ny<m

#define edl printf("\n")

#define infinity 1e16

#define mod 1000000007

#define cn continue

#define csprint1 printf("Case %lld: ", cs++)

#define csprint2 printf("Case %lld:\n", cs++)

#define sf(a) scanf("%lld", &a)

#define sff(a,b) scanf("%lld %lld",&a,&b)

#define sfff(a,b,c) scanf("%lld %lld %lld",&a,&b,&c)

#define sffff(a,b,c,d) scanf("%lld %lld %lld %lld",&a,&b,&c,&d)

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

#define pfn(a) printf("%lld\n",a)

#define pfs(a) printf("%lld ",a)



using namespace __gnu_pbds;

using namespace std;

typedef pair<ll, ll> pl;

typedef vector<int> vi;

typedef vector<pl> vpi;

typedef vector<pl> vpl;

typedef tree<pair<ll, int> , null_type, less<pair<ll, int> >, rb_tree_tag, tree_order_statistics_node_update> ost;

#define error(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }

void err(istream_iterator<string> it) {}

template<typename T, typename... Args>

void err(istream_iterator<string> it, T a, Args... args)

{

    cerr << *it << " = " << a <<","<< spc;

    err(++it, args...);

    cout<<edl;

}

///Bit manipulation



bool checkbit(int mask,int bit){return mask & (1<<bit);}

int setbit(int mask,int bit){ return mask | (1<<bit) ; }

int clearbit(int mask,int bit){return mask & ~(1<<bit);}

int togglebit(int mask,int bit){return mask ^ (1<<bit);}

int bitno(int mask) {return (int)__builtin_popcount(mask);}



/*----------------------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

/*------------------------------------------------*/



///=====================================///



const int  maX=1e5+10;

ll M = 10000007;

int main() {

    ll n;sf(n);

    ll ara[n];

    for(ll i=0;i<n;i++)sf(ara[i]);

    ll sum=0;

    ll dp[maX];

    dp[n-1]=0;

    for(ll i=n-2;i>=0;i--){

        ll x,y;

        x=dp[i+1]+abs(ara[i]-ara[i+1]);

        y=infinity;

        if(i+2<n){

            y=dp[i+2]+abs(ara[i]-ara[i+2]);

        }

        //cout<<x<<spc<<y<<endl;

        dp[i]=min(x,y);

    }

    pfn(dp[0]);

return 0;

}