// 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.273777114221815x):
#define _CRT_SECURE_NO_WARNINGS

#include<iostream>

#include<iomanip>

#include<cmath>

#include<numeric>

#include<vector>

#include<algorithm>

#include<string>

#include<deque>

#include<stack>

#include<map>

#include<cstring>

#include<random>

#include<queue>

#include<iterator>

#include<bitset>

#include<unordered_set>

#include<set>



using namespace std;

#define ll long long

#define endl "\n"

const int dx[] = { -1 , -1 , -1 , 0 , 0 , 0 , 1 , 1 , 1 };

const int dy[] = { -1 , 0 , 1 , -1 , 0 , 1 , -1 , 0 , 1 };

const ll integer = pow(2, 32) - 1; // 4294967295

#define N 8010000

#define TC int t;cin>>t;for(int T=1;T<=t;T++)

#define mod 1000000007

#define PI acos(-1)

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

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

#define clr(v, d) memset(v, d, sizeof(v)) 

void AIA() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); }

bool isprime(ll n) {

	for (ll i = 2; i * i <= n; i++) {

		if (n % i == 0)return 0;

	}

	return (n != 1);

}

ll gcd(ll x, ll y)

{

	return (y == 0 ? x : gcd(y, x % y));

}

ll lcm(ll x, ll y) {

	return (x * y) / gcd(x, y);

}

/*

 _____________              __                ___        ___       ___________________________     ____        ____

|             |            /\ \              |   |      |   |     |                           |    \   \      /   /

|   __________|           / /\ \             |   |      |   |     |      _____      _____     |     \   \    /   /

|  |                     / /  \ \            |   |      |   |     |     |     |    |     |    |      \   \  /   /

|  |                    / /    \ \           |   |      |   |     |     |     |    |     |    |       \   \/   /

|  |______             / /      \ \          |   |______|   |     |     |     |    |     |    |        \      /

|         |           / /        \ \         |              |     |     |     |    |     |    |         \    /

|   ______|          / /          \ \        |    ______    |     |     |     |    |     |    |          |  |

|  |                / /============\ \       |   |      |   |     |     |     |    |     |    |          |  |

|  |               / /==============\ \      |   |      |   |     |     |     |    |     |    |          |  |

|  |              / /                \ \     |   |      |   |     |     |     |    |     |    |          |  |

|  |             / /                  \ \    |   |      |   |     |     |     |    |     |    |          |  |

|__|            /_/                    \_\   |___|      |___|     |_____|     |____|     |____|          |__|



										  <<<<<<<<<<< NEVER GIVE UP !! >>>>>>>>>>>

										<<<<<<<< YOU CAN DO IT IF YOU WANT !! >>>>>>>>

										 <<<<<<<<< BELIEVE IN YOURSELF !! >>>>>>>>>

*/

int n, x, k, m, cnt = 0;

vector<int>v1, v2, v3;

int dp[100007];

int main()

{

	//cout<<fixed<<setprecision(20);

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

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

	AIA();

	cin >> n;

	v1.resize(n);

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

		cin >> v1[i];

	}

	dp[1] = abs(v1[0] - v1[1]);

	for (int i = 2; i < n; i++) {

		dp[i] = min(dp[i - 1] + abs(v1[i] - v1[i - 1]), dp[i - 2] + abs(v1[i] - v1[i - 2]));

	}

	cout << dp[n - 1];

	return 0;

}