// Slower C++ solution:
// Created by ahmed_drawy on 10/09/19.

///dp educational contest atcoder - vjudge

#include <bits/stdc++.h>

#include <string.h>

#pragma clang diagnostic push

#pragma ide diagnostic ignored "OCUnusedMacroInspection"

using namespace std;

#define lp(i,start , end)       for(int i = start ; i<end ; ++i)

#define lllp(i,start , end)       for(ll i = start ; i<end ; ++i)

#define inN(arr ,  n) for(int i = 0 ; i< n ; ++i)  cin>>arr[i];

#define Rlp(i,start , end)      for(int i = start ; i>end ; --i)

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

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

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

#define inf 0x3f3f3f3f

//#define dbg (v)    for(auto it : v)cout<<it<<' ';

typedef long long               ll;

typedef vector<int>             vi;

typedef vector  <ll>            vll;

typedef vector<vector<int> >    adj;

typedef pair<int ,int>          pii;

const double EPS =1e-7;

const int OO = 1e6;

#define endl '\n'

#define cint(c) (int)c -'0';

#define itc(c) (char)c +'A';

bool sortpair( const pair<int , int> & x, const pair<int , int> & y){

    return  x.first != y.first ? x.first < y.first : x.second > y.second ;

}

int dcomp(double x , double y){

    return fabs(x-y) <= EPS? 0: x>y?1:-1;

}



void smile() {

    ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);

#ifndef ONLINE_JUDGE

//    freopen("/home/tw3/Desktop/Desktop/training/in.txt", "r", stdin);

//    freopen("/home/tw3/Desktop/Desktop/training/out.txt" , "w" , stdout);

#endif

}

#define fastin smile()



int n ;

const int N = 1e5 +3;

ll dp[N];

int h[N];

//ll solve(int indx , int state){

//    if(indx == n-1 )return 0 ;

//    ll &ret = dp[indx  ] [ state];

//    if(~ret )

//        return ret;

//    ret=  INT_MAX;

//    for (int i = 1; i <=2 && i+indx < n ; ++i) {

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

//    }

//    return ret ;

//}

int main() {

    fastin;

    cin >> n;

    inN(h,  n );

    clr(dp , 0);

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

        if(j>=2){

            dp[j] = min(dp[j-1] + abs(h[j-1] - h[j]) , abs(h[j-2] - h[j])+dp[j-2]);

        }

        else if(j ==1){

            dp[j] = abs(h[j] - h[j-1])+dp[j-1];

        }

    }

    cout << dp[n-1];

//

//    clr(dp , -1);

//    cout << solve(0, 1)<<endl;

}

// Faster C++ solution for the same problem (measured speedup: 1.76842211041963x):
#define _CRT_SECURE_NO_WARINGS

#include<iostream>

#include<iomanip>

#include<map>

#include<cmath>

#include<algorithm>

#include<string>

#include<vector>

#include<queue>

#include<set>

#include<deque>

#include<stack>

#include<bitset>

#include<fstream>

#include<map>

#include<unordered_map>

using namespace std;

typedef int me;

typedef long long ll;

typedef unsigned long long ull;

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

#define endl '\n'

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

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

#define PI 3.1415926535

#define sin(i) (long double)sin(i*PI/180.0);

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

ull lcm(ll x, ll y) { return x / gcd(x, y) * y; }

void the_end() {

#ifndef ONLINE_JUDGE;

    system("pause");

#endif

}

int dy8[] = { 0,0,1,-1,1,-1,-1,1 };

int dx8[] = { 1,-1,0,0,1,-1,1,-1 };

int id8[] = { 0, 1,2,3,4, 5,6, 7 };

// you can be specialist 

// soon will be (Cyain)

ll n;

vector<ll>v;

map<int, ll>m;

ll solve(int i)

{

    if (i == 0)

        return 0;

    if (i == 1) {

        return abs(v[i] - v[i - 1]);

    }

    if (m.find(i) != m.end())

        return m[i];

    return m[i] = min(solve(i - 1) + abs(v[i] - v[i - 1]), solve(i - 2) + abs(v[i] - v[i - 2]));

}

int main()

{

    andrew;

    cin >> n;

    v.resize(n);

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

    cout << solve(n-1)<< endl;

    the_end();

}