// Slower C++ solution:


/**

    And in the end, the love you take is equal to the love you make.



        I LOVE YOU LAURA.

**/



#include <bits/stdc++.h>

#include <ext/pb_ds/assoc_container.hpp>

#include <ext/pb_ds/tree_policy.hpp>

#include <ext/rope>



#define _CRT_SECURE_NO_DEPRECATE

#define _CRT_DISABLE_PERFCRIT_LOCKS



#define findOrder find_by_order

#define orderKey order_of_key



#define isOn(mask, i) (mask & (1 << i))

#define turn(mask, i) (mask |= (1 << i))

#define switch(mask, i) (mask &= ~(1 << i))

#define change(mask, i) (mask ^= (1 << i))

#define lowbit(mask) (mask & (-mask))

#define turnAll(mask, n) (mask = (1 << n) - 1)

#define switchLastBit(mask) (mask & (mask - 1))

#define turnLastZero(mask) (mask | (mask + 1))

#define modulo(x, mod) ((x) & (mod - 1))

#define log2(x) (31 - __builtin_clz(x))



#define mkp make_pair

#define pb push_back

#define pf push_front

#define eb emplace_back

#define ef emplace_front

#define ins insert

#define rsz resize

#define f first

#define s second

#define lb lower_bound

#define ub upper_bound



#define sz(x) ((int)x.size())

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

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



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



using namespace std;

using namespace __gnu_pbds;

using namespace __gnu_cxx;



typedef double db;

typedef long long ll;

typedef long double ld;

typedef unsigned long long ull;



typedef pair<int, int> ii;

typedef pair<ll,ll> pll;

typedef pair<ld,ld> pdb;

typedef pair<int, ii> tri;

typedef complex<ld> cd;



typedef vector<int> vi;

typedef vector<ii> vii;

typedef vector<ld> vdb;

typedef vector<cd> vcd;

typedef vector<ll> vll;

typedef vector<string> vs;

typedef vector<vll> matrix;



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



const ll mod = 1e9+7;

const int maxn = 2e5+2;

const int pi = 2 * acos(0.0);

const db eps = 1e-9;



ll arr[maxn], dp[maxn];



int main()

{

    ios_base::sync_with_stdio(0);

    cin.tie(0); cout.tie(0);



    int n; cin >> n;



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

        cin >> arr[i];

    }



    memset(dp, 63, sizeof dp);



    dp[1] = 0;

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

        if (i <= 2){

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

        }

        else{

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

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

        }

    }



    cout << dp[n] << "\n";



    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 2.5684679808748605x):
#include <bits/stdc++.h>

#include <algorithm>

#include <climits>

#include <ext/pb_ds/assoc_container.hpp>

#include <ext/pb_ds/tree_policy.hpp>

#include <iostream>

#include <math.h>

using namespace __gnu_pbds;

using namespace std;

#define ll long long

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

#define vll vector<ll> 

#define nl cout << endl

#define fr(a,b) for(auto i=a;i<b;i++)

#define pll pair<ll,ll>

#define f first

#define s second

#define vpll vector<pll>

#define ump unordered_map

#define YES cout << "YES" << endl

#define NO cout << "NO" << endl

#define IN(a,b) ((a).find(b)!=(a).end())

#define pb push_back

#define mkp make_pair

#define PI M_PI

#define INF 1e18

#define deb(x) if(ON) cout << #x <<" : " << x << endl

#define fast ios_base::sync_with_stdio(false)

#define io cin.tie(NULL),cout.tie(NULL)

#define ON !false

ll dx[]={0,-1,0,1};

ll dy[]={1,0,-1,0};

const ll mod=1e9+7;

ll i,j;

ll add(ll a,ll b){

    return  ((a%mod)+(b%mod)+mod)%mod;

}

ll mul(ll a,ll b){

    return ((a%mod)*(b%mod)+mod)%mod;

}

void pause(ll id){

    cout << "Waiting " << id << endl;

    cin >> id;

}



const int mxn=1e5+10;

ll n,t;





signed main(){

    fast;

    io;

    if(!true){

        freopen("in.txt","r",stdin);

        freopen("out.txt","w",stdout);

    }



    cin >> n;

    ll h[n];

    vll ans(n,0);

    ll i,j;

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

        cin >> h[i];

    }

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

        ll mn=abs(h[i]-h[i-1])+ans[i-1];

        if(i>=2){

            mn=min(mn,abs(h[i]-h[i-2])+ans[i-2]);

        }

        ans[i]+=mn;

    }

    cout << ans[n-1] << endl;

   

    return 0;

}