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

#include <ext/pb_ds/assoc_container.hpp>

#include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;

using namespace std;

#define DEBUG

#ifdef DEBUG

#define debug(...) __f(#__VA_ARGS__, __VA_ARGS__)

	template <typename Arg1>

	void __f(const char* name, Arg1&& arg1){

		cerr << name << " : " << arg1 << std::endl;

	}

	template <typename Arg1, typename... Args>

	void __f(const char* names, Arg1&& arg1, Args&&... args){

		const char* comma = strchr(names + 1, ','); cerr.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...);

	}

#else

#define debug(...)

#endif

#define FOR(i,a,b) 	for(int i=a;i<b;++i)

#define RFOR(i,a,b) 	for(int i=a;i>=b;--i)

#define ln 		"\n"

#define mp make_pair

#define pb push_back

#define sz(a)	ll(a.size())

#define F first

#define S second

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

#define rall(c) c.rbegin(), c.rend()

#define trace(c,x) for(auto &x:c)

#define pii pair<ll,ll>

#define init(a, x) memset(a,x,sizeof(a))

typedef long long ll;

typedef long double ld;

typedef	priority_queue<pii,std::vector<pii>,greater<pii> > revpr;



typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> pbds;

// ordered_set X

//K-th smallest

//*X.find_by_order(k-1)

//NO OF ELEMENTS < A

//X.order_of_key(A)

const int L=1e6+7;

ll n, h[L], dp[L];

ll solve(int i)

{

	if(i==n-1)return 0;

	if(i>=n)return INT_MAX;

	if(dp[i] != -1)return dp[i];

	ll &ret = dp[i];

	ret = INT_MAX;

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

	ret = min(ret,solve(i+2) + abs(h[i]-h[i+2]));

	return ret;

}

void fff()

{

	cin >> n;

	init(dp, -1);

	FOR(i,0,n)cin >> h[i];

	cout<<solve(0)<<ln;

}

int main()

{

	ios_base::sync_with_stdio(false);

	cin.tie(NULL);

	cout.tie(NULL);

	//int t;cin >> t;while(t--)

	fff();

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 9.312232525465546x):
////=====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;

}