stablegradients/pie-gem5-pairs huggingface dataset:
// Slower C++ solution:
#include <bits/stdc++.h>



using namespace std;



const int N = 1e5; // Maximum stones as per problem



int n, stones[N];



int memo[N]; // Memoization Table



int jumps(int ind) {

    if (ind == (n - 1)) return 0; // If we are last stone, then the answer will be 0.

    if (ind >= n) return INT_MAX; // Checking the boundary condition





    // If you are done with the whole function, then only read

    // Since we stored the minimum cost for a stone, now we will use the stored cost

    // We are initializing the table to -1, if the value stored is not -1, then we have calculated the minimum cost

    // So just return that cost

    if (memo[ind] != -1) return memo[ind]; // If reading for first time, then ignore this line



    // Calculate the cost for jumping to next stone (ind + 1) and recursively doing it for next stone

    int oneJump = abs(stones[ind] - stones[ind + 1]) + jumps(ind + 1);



    // Initializing the twoJumps because there can be a case in which there can be only one stone.

    int twoJumps = INT_MAX;



    // Checking if there are more than 2 stones

    if (ind + 2 < n) {

        // Calculate the cost for jumping to next to next stone (ind + 2) and recursively doing it for next to next stone

        twoJumps = abs(stones[ind] - stones[ind + 2]) + jumps(ind + 2);

    }



    // Storing the minimum cost in the memoization table and returning the minimum cost

    // After this,  go to the ignored line.

    return memo[ind] = min(oneJump, twoJumps);

}





int main() {

    // Initializing the memoization table to -1

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



    cin >> n;

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

        cin >> stones[i];

    }



    // We will start from first stone

    cout << jumps(0) << endl;



    return 0;

}

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



using namespace std;



#define oo (1L<<62)

#define ll long long int



int h[100005];

ll memo[100005];

char visitado[100005];

int N;



ll memoiter[3];



ll costo(int  n){

    if(!n) return n;

    if(n == 1) return abs(h[0]-h[1]);

    if(visitado[n]) return memo[n];

    visitado[n] = 1;

    return memo[n]= min(costo(n-1)+abs(h[n]-h[n-1]), 

                    costo(n-2)+abs(h[n]-h[n-2])); 

}



ll iterativo(){

    memoiter[0] = 0;

    memoiter[1] = abs(h[0]-h[1]);

    for(int i = 2; i<N; i++)

        memoiter[i%3] = min(memoiter[(i-1)%3]+abs(h[i]-h[i-1]),

                      memoiter[(i-2)%3]+abs(h[i]-h[i-2]));

    return memoiter[(N-1)%3];

}

    



int main()

{

    cin>>N;

    for(int i = 0; i<N;i++)

        cin>>h[i];

    cout<<costo(N-1)<<"\n";

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

using namespace std;

#define ll long long

#define ull unsigned long long

#define INF 1e18

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

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

typedef vector<int> vi;

typedef vector<ll> vll;

typedef pair<int,int> pi;



#define M_PI 3.14159265358979323846



int a[100005];

const int oo = 1e9+10;

const int mod = 7901;



ll gcd(ll a, ll b){return a==0 ? b : gcd(b%a, a);}



int dp[100005];

int n;

int memo[100005];



int dpF(int i){

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

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

	

	int ans = abs(a[i] - a[i+1])+dpF(i+1);

	if(i+2 <= n-1){

		ans = min(ans, abs(a[i]-a[i+2])+dpF(i+2));

	}



	return memo[i] = ans;

}



void solve(){

	cin>>n;

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

	

	memset(memo, -1 , sizeof memo);

	cout << dpF(0) << '\n';

	return;

	dp[0] = 0;

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

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

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

	}

	cout << dp[n-1] << '\n';

}

int main(){   

    ios::sync_with_stdio(0);cin.tie(0);

	int t=1;

	while(t--){

		solve();

	}

}

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



using namespace std;



#define oo (1L<<62)

#define ll long long int



int h[100005];

ll memo[100005];

char visitado[100005];

int N;



ll memoiter[3];



ll costo(int  n){

    if(!n) return n;

    if(n == 1) return abs(h[0]-h[1]);

    if(visitado[n]) return memo[n];

    visitado[n] = 1;

    return memo[n]= min(costo(n-1)+abs(h[n]-h[n-1]), 

                    costo(n-2)+abs(h[n]-h[n-2])); 

}



ll iterativo(){

    memoiter[0] = 0;

    memoiter[1] = abs(h[0]-h[1]);

    for(int i = 2; i<N; i++)

        memoiter[i%3] = min(memoiter[(i-1)%3]+abs(h[i]-h[i-1]),

                      memoiter[(i-2)%3]+abs(h[i]-h[i-2]));

    return memoiter[(N-1)%3];

}

    



int main()

{

    cin>>N;

    for(int i = 0; i<N;i++)

        cin>>h[i];

    cout<<costo(N-1)<<"\n";

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

#define endl '\n'

#define ll long long

using namespace std;



const int MXN = 1e5 + 5;

int n;

int h[MXN];

int dp[MXN];



int Dp(int idx) {

    if(idx == n - 1) return 0; // caso base

    if(dp[idx] != -1) return dp[idx]; // caso dp

    int ans = Dp(idx + 1) + abs(h[idx] - h[idx + 1]);

    if(idx + 2 < n) ans = min(ans, Dp(idx + 2) + abs(h[idx] - h[idx + 2])); 

    return dp[idx] = ans; // guardar

}



int main() {

    ios_base::sync_with_stdio(false); cin.tie(NULL);

    cin >> n;

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

        cin >> h[i];

    }

    memset(dp, -1, sizeof dp);

    cout << Dp(0) << endl;

    return 0;

}

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



using namespace std;



#define oo (1L<<62)

#define ll long long int



int h[100005];

ll memo[100005];

char visitado[100005];

int N;



ll memoiter[3];



ll costo(int  n){

    if(!n) return n;

    if(n == 1) return abs(h[0]-h[1]);

    if(visitado[n]) return memo[n];

    visitado[n] = 1;

    return memo[n]= min(costo(n-1)+abs(h[n]-h[n-1]), 

                    costo(n-2)+abs(h[n]-h[n-2])); 

}



ll iterativo(){

    memoiter[0] = 0;

    memoiter[1] = abs(h[0]-h[1]);

    for(int i = 2; i<N; i++)

        memoiter[i%3] = min(memoiter[(i-1)%3]+abs(h[i]-h[i-1]),

                      memoiter[(i-2)%3]+abs(h[i]-h[i-2]));

    return memoiter[(N-1)%3];

}

    



int main()

{

    cin>>N;

    for(int i = 0; i<N;i++)

        cin>>h[i];

    cout<<costo(N-1)<<"\n";

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

using namespace std;



const int inf=0x3f;

int h[100005],dp[100005];



signed main()

{

	int n;

	while(cin>>n){

		for(int i=1;i<=n;i++)cin>>h[i];

		memset(dp,inf,sizeof dp);

		

		dp[1]=0,dp[2]=abs(h[2]-h[1]);

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

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

		}

		cout<<dp[n]<<endl;

	}

	return 0;

}

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



using namespace std;



#define oo (1L<<62)

#define ll long long int



int h[100005];

ll memo[100005];

char visitado[100005];

int N;



ll memoiter[3];



ll costo(int  n){

    if(!n) return n;

    if(n == 1) return abs(h[0]-h[1]);

    if(visitado[n]) return memo[n];

    visitado[n] = 1;

    return memo[n]= min(costo(n-1)+abs(h[n]-h[n-1]), 

                    costo(n-2)+abs(h[n]-h[n-2])); 

}



ll iterativo(){

    memoiter[0] = 0;

    memoiter[1] = abs(h[0]-h[1]);

    for(int i = 2; i<N; i++)

        memoiter[i%3] = min(memoiter[(i-1)%3]+abs(h[i]-h[i-1]),

                      memoiter[(i-2)%3]+abs(h[i]-h[i-2]));

    return memoiter[(N-1)%3];

}

    



int main()

{

    cin>>N;

    for(int i = 0; i<N;i++)

        cin>>h[i];

    cout<<costo(N-1)<<"\n";

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

using namespace std;

vector<int> dp(100001,-1);



int back(vector<int> &N, int index){

	if(index+2==N.size()){

		return abs(N[index]-N[index+1]);

	}

	if(index+1==N.size()){

		return 0;

	}

	if(dp[N.size()-index]!=-1)return dp[N.size()-index];

	int a = abs(N[index]-N[index+1]) + back(N,index+1);

	int b = abs(N[index]-N[index+2]) + back(N,index+2);

	

	dp[N.size()-index] = min(a,b);

	return dp[N.size()-index];

}



int main(){

//	10 30 40 20

	int n;

	cin>>n;

	vector<int> N(n);

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

		cin>>N[i];

	}

	dp[0]=0;

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



	cout<<back(N,0);	

}

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



using namespace std;



#define oo (1L<<62)

#define ll long long int



int h[100005];

ll memo[100005];

char visitado[100005];

int N;



ll memoiter[3];



ll costo(int  n){

    if(!n) return n;

    if(n == 1) return abs(h[0]-h[1]);

    if(visitado[n]) return memo[n];

    visitado[n] = 1;

    return memo[n]= min(costo(n-1)+abs(h[n]-h[n-1]), 

                    costo(n-2)+abs(h[n]-h[n-2])); 

}



ll iterativo(){

    memoiter[0] = 0;

    memoiter[1] = abs(h[0]-h[1]);

    for(int i = 2; i<N; i++)

        memoiter[i%3] = min(memoiter[(i-1)%3]+abs(h[i]-h[i-1]),

                      memoiter[(i-2)%3]+abs(h[i]-h[i-2]));

    return memoiter[(N-1)%3];

}

    



int main()

{

    cin>>N;

    for(int i = 0; i<N;i++)

        cin>>h[i];

    cout<<costo(N-1)<<"\n";

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

using namespace std;

#define mod 1000000009

#define ll long long

#define mp make_pair

#define pb push_back

#define ff first

#define ss second

#define set0(a) memset ((a), 0 , sizeof(a))

#define set1(a) memset((a),-1,sizeof (a))

#define pi pair<int, int>

#define ps pair<string, string>

#define pl pair<long, long>

#define pll pair<long long, long long>

#define vll vector<long long>

#define vl vector<long>

#define vi vector<int>

#define vs vector<string>

#define vps vector< ps >

#define vpi vector< pi >

#define vpl vector< pl >

#define vpll vector< pll >

#define flash  ios_base::sync_with_stdio(false); cin.tie(NULL);

#define tc(t,T) for(long long t=0;t<T;t++)

#define rep(i,s,n,d) for(long long i=s;i<n;i=i+d)

#define meax 100007

 vll a(meax,0);

  vll b(meax,meax);

  ll sum1=0;

ll maximize(ll i,ll n,ll prev){



    if(b[i]!=meax){

        return b[i];

    }

    if(i>=n){

        return meax;

    }



    if(i==n-1){

            b[i]=0;

        return b[i];

    }

    ll d1=maximize(i+1,n,a[i]);

    ll d2=maximize(i+2,n,a[i]);

    b[i]=min(abs(a[i]-a[i+1])+d1,abs(a[i+2]-a[i])+d2);

    return b[i];





}

int main(){

    ll n;

    cin>>n;



    rep(i,0,n,1){

        cin>>a[i];

    }

    ll d=maximize(0,n,a[0]);

    cout<<d<<endl;

}


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



using namespace std;



#define oo (1L<<62)

#define ll long long int



int h[100005];

ll memo[100005];

char visitado[100005];

int N;



ll memoiter[3];



ll costo(int  n){

    if(!n) return n;

    if(n == 1) return abs(h[0]-h[1]);

    if(visitado[n]) return memo[n];

    visitado[n] = 1;

    return memo[n]= min(costo(n-1)+abs(h[n]-h[n-1]), 

                    costo(n-2)+abs(h[n]-h[n-2])); 

}



ll iterativo(){

    memoiter[0] = 0;

    memoiter[1] = abs(h[0]-h[1]);

    for(int i = 2; i<N; i++)

        memoiter[i%3] = min(memoiter[(i-1)%3]+abs(h[i]-h[i-1]),

                      memoiter[(i-2)%3]+abs(h[i]-h[i-2]));

    return memoiter[(N-1)%3];

}

    



int main()

{

    cin>>N;

    for(int i = 0; i<N;i++)

        cin>>h[i];

    cout<<costo(N-1)<<"\n";

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

using namespace std;

int n;

int h[1000005], memo[1000005];

int f(int n) {

    if(n == 1) {                        // bisa juga base case nya n = 0, f(0) harus tinggi, misal 1e9;

        return 0;

    }

    if(n == 2) {

        return abs(h[1] - h[2]);

    } 

    else if(memo[n] != -1) {

        return memo[n];

    }

    memo[n] = min(f(n - 1) + abs(h[n] - h[n - 1]), f(n - 2) + abs(h[n] - h[n - 2]));

    return memo[n];

}



int main() {

    scanf("%d", &n);

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

        scanf("%d", &h[i]);

    }

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

    f(n);

    printf("%d\n", f(n));

}

// Faster C++ solution for the same problem (measured speedup: 2.7711053263050083x):
/**

 * @author      : Luis Miguel Baez <es.luismiguelbaez@gmail.com>

 * @created     : Thursday August 13, 2020

 */



#include <bits/stdc++.h>



using namespace std;



#define endl '\n'

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

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

#define ms(arr, value) memset(arr, value, sizeof arr)

#define ll    int64_t



#define debug(...) "[" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "



string to_string(string s) {

    return '"' + s + '"';

}



string to_string(bool b) {

    return (b ? "true" : "false");

}



// add template here



template <typename A>

string to_string(A v) {

    bool first = true;

    string res = "{";

    for (const auto &x : v) {

        if (!first) {

            res += ", ";

        }

        first = false;

        res += to_string(x);

    }

    res += "}";

    return res;

}



template<class T>

void println(const T &data) {

#ifndef ONLINE_JUDGE

    cout << to_string((T)data) << endl;

#endif

}





const int oo  = (int)(1e9);

const ll lloo  = (ll)(1e18);



const int N = 1e5 + 10;



class Task {

public:

    int n;

    vector<int> A;



    ll dp[N];



    ll go(int index) {

        if(index > n) return 0LL;

        if(index == n) {

            return 0LL;

        }



        ll &ans = dp[index];

        if(ans != -1) return ans;



        ll x = oo;

        ll y = oo;



        if(index+1 <= n) {

            x = abs(A[index]-A[index+1]) + go(index + 1);

        }

        

        if(index+2 <= n) {

            y = abs(A[index]-A[index+2]) + go(index + 2);

        }

        ll mn = min(x, y);

        if(mn == oo) {

            ans = 0;

            return ans;

        }

        ans = min(x, y);

        return ans;

    }



    ll solveOne(istream &in, ostream &out) {

        in >> n;

        A.resize(n+1);

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

            in >> A[i];

        }

        memset(dp, -1, sizeof dp);

        ll ans = go(1);

        return ans;  

    }

    

    void solve(istream &in, ostream &out) {

        int t = 1;

        while(t--) {

            out << solveOne(in, out) << endl;

        }

    }

};



auto main() -> int {

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    cout.tie(NULL);

    

    Task solver;

    istream &in(cin);

    ostream &out(cout);

    solver.solve(in, out);

    return 0;

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

using namespace std;

#define IO ios::sync_with_stdio(false), cin.tie(0)

typedef long long ll;

const int maxn = 1e6 + 5;

const int inf = 0x3f3f3f3f;

ll a[maxn];

ll dp[maxn];



int main()

{

    IO;

    int n, k=2;

    cin >> n ;

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

        cin >> a[i];

    memset(dp, inf, sizeof(dp));

    dp[1] = 0;

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

    {

        for (int j = 1; j <= k; ++j)

        {

            dp[i] = min(dp[i], dp[max(i - j, 1)] + abs(a[i] - a[max(i - j, 1)]));

        }

    }

    cout << dp[n] << endl;

}


// Faster C++ solution for the same problem (measured speedup: 5.146375696838801x):
/**

 * @author      : Luis Miguel Baez <es.luismiguelbaez@gmail.com>

 * @created     : Thursday August 13, 2020

 */



#include <bits/stdc++.h>



using namespace std;



#define endl '\n'

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

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

#define ms(arr, value) memset(arr, value, sizeof arr)

#define ll    int64_t



#define debug(...) "[" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "



string to_string(string s) {

    return '"' + s + '"';

}



string to_string(bool b) {

    return (b ? "true" : "false");

}



// add template here



template <typename A>

string to_string(A v) {

    bool first = true;

    string res = "{";

    for (const auto &x : v) {

        if (!first) {

            res += ", ";

        }

        first = false;

        res += to_string(x);

    }

    res += "}";

    return res;

}



template<class T>

void println(const T &data) {

#ifndef ONLINE_JUDGE

    cout << to_string((T)data) << endl;

#endif

}





const int oo  = (int)(1e9);

const ll lloo  = (ll)(1e18);



const int N = 1e5 + 10;



class Task {

public:

    int n;

    vector<int> A;



    ll dp[N];



    ll go(int index) {

        if(index > n) return 0LL;

        if(index == n) {

            return 0LL;

        }



        ll &ans = dp[index];

        if(ans != -1) return ans;



        ll x = oo;

        ll y = oo;



        if(index+1 <= n) {

            x = abs(A[index]-A[index+1]) + go(index + 1);

        }

        

        if(index+2 <= n) {

            y = abs(A[index]-A[index+2]) + go(index + 2);

        }

        ll mn = min(x, y);

        if(mn == oo) {

            ans = 0;

            return ans;

        }

        ans = min(x, y);

        return ans;

    }



    ll solveOne(istream &in, ostream &out) {

        in >> n;

        A.resize(n+1);

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

            in >> A[i];

        }

        memset(dp, -1, sizeof dp);

        ll ans = go(1);

        return ans;  

    }

    

    void solve(istream &in, ostream &out) {

        int t = 1;

        while(t--) {

            out << solveOne(in, out) << endl;

        }

    }

};



auto main() -> int {

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    cout.tie(NULL);

    

    Task solver;

    istream &in(cin);

    ostream &out(cout);

    solver.solve(in, out);

    return 0;

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



using namespace std;



int n, h[100002], dp[100002][3];



int sol(int i, int choice){

    if(i==0) return 0;

    if(i<0) return 1E9;



    int &ret = dp[i][choice];

    if(~ret) return ret;



    return ret = min(abs(h[i]-h[i-1]) + sol(i-1, 1), abs(h[i]-h[i-2]) + sol(i-2, 2));

}



int main()

{

    cin >> n;

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

        cin >> h[i];



    memset(dp, -1, sizeof dp);

    cout << min(sol(n-1, 1), sol(n-1, 2));

}


// Faster C++ solution for the same problem (measured speedup: 1.2056828988097315x):
/**

 * @author      : Luis Miguel Baez <es.luismiguelbaez@gmail.com>

 * @created     : Thursday August 13, 2020

 */



#include <bits/stdc++.h>



using namespace std;



#define endl '\n'

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

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

#define ms(arr, value) memset(arr, value, sizeof arr)

#define ll    int64_t



#define debug(...) "[" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "



string to_string(string s) {

    return '"' + s + '"';

}



string to_string(bool b) {

    return (b ? "true" : "false");

}



// add template here



template <typename A>

string to_string(A v) {

    bool first = true;

    string res = "{";

    for (const auto &x : v) {

        if (!first) {

            res += ", ";

        }

        first = false;

        res += to_string(x);

    }

    res += "}";

    return res;

}



template<class T>

void println(const T &data) {

#ifndef ONLINE_JUDGE

    cout << to_string((T)data) << endl;

#endif

}





const int oo  = (int)(1e9);

const ll lloo  = (ll)(1e18);



const int N = 1e5 + 10;



class Task {

public:

    int n;

    vector<int> A;



    ll dp[N];



    ll go(int index) {

        if(index > n) return 0LL;

        if(index == n) {

            return 0LL;

        }



        ll &ans = dp[index];

        if(ans != -1) return ans;



        ll x = oo;

        ll y = oo;



        if(index+1 <= n) {

            x = abs(A[index]-A[index+1]) + go(index + 1);

        }

        

        if(index+2 <= n) {

            y = abs(A[index]-A[index+2]) + go(index + 2);

        }

        ll mn = min(x, y);

        if(mn == oo) {

            ans = 0;

            return ans;

        }

        ans = min(x, y);

        return ans;

    }



    ll solveOne(istream &in, ostream &out) {

        in >> n;

        A.resize(n+1);

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

            in >> A[i];

        }

        memset(dp, -1, sizeof dp);

        ll ans = go(1);

        return ans;  

    }

    

    void solve(istream &in, ostream &out) {

        int t = 1;

        while(t--) {

            out << solveOne(in, out) << endl;

        }

    }

};



auto main() -> int {

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    cout.tie(NULL);

    

    Task solver;

    istream &in(cin);

    ostream &out(cout);

    solver.solve(in, out);

    return 0;

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

using namespace std;

int dif(int a, int b)

{

    int ans=a-b;

    if(ans<0) ans*=-1;

    return ans;

}

int main()

{

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    int N, h[100005],i,j;

    int f1,f2;

    cin>>N;

    for(i=0;i<N;i++)

        cin>>h[i];

    int M[100005]={0};

    M[N-2]=dif(h[N-1],h[N-2]);

    for(i=N-3;i>=0;i--)

    {

        f1=dif(h[i+1],h[i])+M[i+1];

        f2=dif(h[i+2],h[i])+M[i+2];

        M[i]=min(f1,f2);

    }

    cout<<M[0]<<endl;

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 1.4022220478333507x):
#include <iostream>

#include <vector>

#include <cmath>

#include <set>

#include <queue>

#include <map>

#include <cstdio>

#include <cstring>

#include <string>

#include <stack>

#include <algorithm>

#include <limits.h>

#include <bits/stdc++.h>

#define fw(x) freopen("x.txt","w",stdout)

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

#define REP(i,n) for(int i = 0;i < n;++i)

#define REP1(i,n) for(int i = 1; i<=n;i++)

#define mem(a,s) memset(a,s,sizeof a)

#define fast ios_base::sync_with_stdio(0);cin.tie(NULL)

#define pf printf

#define sc scanf

#define ll long long

#define pii pair<int,int>

#define pll pair<ll,ll>

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

#define vii vector<int>

#define vll vector<ll>

#define vss vector<string>

#define debug(x)  cout<<#x"="<<(x)<<endl

#define pb push_back





using namespace std;





// moves



//int dx[]= {0,0,1,-1};/*4 side move*/

//int dy[]= {-1,1,0,0};/*4 side move*/

//int dx[]= {1,1,0,-1,-1,-1,0,1};/*8 side move*/

//int dy[]= {0,1,1,1,0,-1,-1,-1};/*8 side move*/

//int dx[]={1,1,2,2,-1,-1,-2,-2};/*knight move*/

//int dy[]={2,-2,1,-1,2,-2,1,-1};/*knight move*/





//big_mod



//ll bigmod(ll a,ll b,ll m)

//{if(b == 0) return 1%m;ll x = bigmod(a,b/2,m);x = (x * x) % m;if(b % 2 == 1) x = (x * a)% m;return x;}

//ll BigMod(ll B,ll P,ll M){ ll R=1%M; while(P>0) {if(P%2==1){R=(R*B)%M;}P/=2;B=(B*B)%M;} return R;} /// (B^P)%M



//ll getBit(ll num, int idx) {return ((num >> idx) & 1ll) == 1ll;}

//ll setBit1(ll num, int idx) {return num or (1ll<<idx);}

//ll setBit0(ll num, int idx) {return num & ~(1ll<<idx);}

//ll flipBit(ll num, int idx) {return num ^ (1ll<<idx);}



const int mod = 1000000007;



int main()

{

    fast;

    int n;

    cin>>n;

    int arr[n];

    REP(i, n) cin>>arr[i];

    int cost[n] = {0};

    cost[1] = abs(arr[1]-arr[0]);

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

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

    }

    cout<<cost[n-1]<<'\n';

    return 0;

}