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

using namespace std;

int n;

long long h[100005];

long long dp[100005];



long long solve(int i){

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

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



	dp[i] = 1e17;

	if(i+1 <= n-1)

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

	if(i+2 <= n-1)

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



	return dp[i];

}



int main(){

	scanf("%d", &n);

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

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

	memset(dp, -1, sizeof dp);

	cout<<solve(0)<<endl;

	return 0;

}

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

using namespace std;

 

typedef long long int ll;

typedef pair<int,int> pi;

priority_queue<pi, vector<pi>, greater<pi> > pq; //min heap

 

ll mini(ll a,ll b){	return a<b?a:b;}

ll maxi(ll a,ll b){	return a>b?a:b;}

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

ll binpow(ll n,ll x){	ll ans = 1;while(x){if(x & 1)	ans *= n;n *= n;x >>= 1;}return ans;}

 

int main()

{

    ios::sync_with_stdio(false);

    cin.tie(0);

    cout.tie(0);

 

    int n;

    cin>>n;

 

    vector<int> A(n+4,0), cost(n+4,0);

 

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

 

    cost[0] = 1200000000;

    cost[1] = 0;

    cost[2] = abs(A[2]-A[1]);

 

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

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

    }

 

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

 

    return 0;

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

using namespace std;

#define ll long long

#define pb push_back

#define mp make_pair

#define ull  unsigned long long

#define vll  vector <long long>

#define pll pair <long long,long long>

#define f first

#define s second

#define up upper_bound

#define lp lower_bound

#define pq priority_queue

#define inf 1e10

#define minf -1e10

#define pi 3.14159265

#define mod 300000000000000000

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

int main()

{

    ll n;

    cin>>n;

    vll vec;

    ll ara[100001];

    memset(ara,0,sizeof(ara));

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

    {

        ll num;

        cin>>num;

        vec.pb(num);

    }

    ll ans=0;

    ara[n-2]=abs(vec[n-2]-vec[n-1]);

    for(ll i=n-3;i>=0;i--)

    {

        ara[i]=min(abs(vec[i]-vec[i+1])+ara[i+1],abs(vec[i]-vec[i+2])+ara[i+2]);

    }

    cout<<ara[0]<<endl;

}


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

using namespace std;

 

typedef long long int ll;

typedef pair<int,int> pi;

priority_queue<pi, vector<pi>, greater<pi> > pq; //min heap

 

ll mini(ll a,ll b){	return a<b?a:b;}

ll maxi(ll a,ll b){	return a>b?a:b;}

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

ll binpow(ll n,ll x){	ll ans = 1;while(x){if(x & 1)	ans *= n;n *= n;x >>= 1;}return ans;}

 

int main()

{

    ios::sync_with_stdio(false);

    cin.tie(0);

    cout.tie(0);

 

    int n;

    cin>>n;

 

    vector<int> A(n+4,0), cost(n+4,0);

 

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

 

    cost[0] = 1200000000;

    cost[1] = 0;

    cost[2] = abs(A[2]-A[1]);

 

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

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

    }

 

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

 

    return 0;

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

using namespace std;

#define ll long long



int ara[100000];

int dp[100000];



int f(int i, int n)

{

    if(i == n) return 0;

    if(dp[i] != -1)

        return dp[i];

    int cost = f(i+1,n) + abs(ara[i] - ara[i+1]);

    if(i+2<=n)

        cost = min(cost, f(i+2,n)+abs(ara[i] - ara[i+2]));

    dp[i] = cost;



    return cost;

}



int main()

{

   int n;

   cin>>n;



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

   {

       cin>>ara[i];

   }



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

   cout<<f(1,n)<<endl;



   return 0;

}






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

using namespace std;

 

typedef long long int ll;

typedef pair<int,int> pi;

priority_queue<pi, vector<pi>, greater<pi> > pq; //min heap

 

ll mini(ll a,ll b){	return a<b?a:b;}

ll maxi(ll a,ll b){	return a>b?a:b;}

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

ll binpow(ll n,ll x){	ll ans = 1;while(x){if(x & 1)	ans *= n;n *= n;x >>= 1;}return ans;}

 

int main()

{

    ios::sync_with_stdio(false);

    cin.tie(0);

    cout.tie(0);

 

    int n;

    cin>>n;

 

    vector<int> A(n+4,0), cost(n+4,0);

 

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

 

    cost[0] = 1200000000;

    cost[1] = 0;

    cost[2] = abs(A[2]-A[1]);

 

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

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

    }

 

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

 

    return 0;

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



#define TR 100000



int l[TR];

using namespace std;

vector<int> h;





int solve(int p) {

	if(p == 0)

		return 0;

	if(p < 0)

		return 10000000;

	if(l[p] != -1)

		return l[p];

	l[p] = min(abs(h[p] - h[p - 1]) + solve(p - 1), abs(h[p] - h[p - 2]) + solve(p - 2));

	return l[p];



}



int main() {

	int n;

	cin >> n;

	memset(l, -1, TR * sizeof(int));

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

		cin >> tmp;

		h.push_back(tmp);

	}

	solve(n - 1);

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

}

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

using namespace std;

 

typedef long long int ll;

typedef pair<int,int> pi;

priority_queue<pi, vector<pi>, greater<pi> > pq; //min heap

 

ll mini(ll a,ll b){	return a<b?a:b;}

ll maxi(ll a,ll b){	return a>b?a:b;}

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

ll binpow(ll n,ll x){	ll ans = 1;while(x){if(x & 1)	ans *= n;n *= n;x >>= 1;}return ans;}

 

int main()

{

    ios::sync_with_stdio(false);

    cin.tie(0);

    cout.tie(0);

 

    int n;

    cin>>n;

 

    vector<int> A(n+4,0), cost(n+4,0);

 

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

 

    cost[0] = 1200000000;

    cost[1] = 0;

    cost[2] = abs(A[2]-A[1]);

 

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

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

    }

 

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

 

    return 0;

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

using namespace std;

#define N (int)2e5

int n,memo[N],c[N];



int dp(int curr) {

    if (curr == n) return 0;

    if (curr > n) return 1e9;

    int &sol = memo[curr];

    if (sol != -1) return sol;

    sol = min(

        dp(curr + 1) + abs(c[curr] - c[curr + 1]) ,

        dp(curr + 2) + abs(c[curr] - c[curr + 2])

    );

    return sol;

}



int main() {

    scanf("%d" , &n);

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

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

    memset (memo , -1 , sizeof memo);

    printf("%d\n" , dp(1));

}


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

using namespace std;

int h[100001];

int dp[100001];

int main(int argc, char const *argv[]) {

    int n;

    scanf("%d", &n);

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

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

    dp[0] = 0;

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

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

        if(i > 1)

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

    }

    printf("%d\n", dp[n-1]);

    return 0;

}
// Slower C++ solution:
#include<set>

#include<map>

#include<cmath>

#include<ctime>

#include<queue>

#include<stack>

#include<cstdio>

#include<string>

#include<vector>

#include<random>

#include<cstdlib>

#include<cstring>

#include<iomanip>

#include<iostream>

#include<algorithm>

#include<unordered_map>

#define endl "\n"

#define fi first

#define se second

#define db double

#define gcd __gcd

#define pb push_back

#define mp make_pair

#define lowbit(x) (x & (-x))

#define PII  pair<int, int> 

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

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

#define rep(i, a, b) for(__typeof(b) i = a; i <= (b); i++)

#define Rep(i, a, b) for(__typeof(a) i = a; i >= (b); i--)

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

template<class T> inline T qmin(T a, T b) { return a < b ? a : b; }

template<class T> inline T qmax(T a, T b) { return a > b ? a : b; }

typedef long long ll;

typedef unsigned long long ull;

const db eps = 1e-9;

const db PI = acos(-1);

const int inf = 0x3f3f3f3f;

const int mod = (int)1e9 + 7;

const int maxn = (int)1e5 + 5;//remember to modify it, No RE or MLE

const ll INF = 0x3f3f3f3f3f3f3f3f;

using namespace std;

ll qpow(ll x, ll y) { ll ret = 1; for( ; y; y >>= 1, x = (x * x) % mod) if(y & 1) ret = (ret * x) % mod; return ret; }



inline int read(){

	char ch = getchar();

	int x = 0, f = 1;

	while(ch < '0' || ch > '9'){

		if(ch == '-') f = -1;

		ch = getchar();

	}

	while('0' <= ch && ch <= '9'){

		x = x * 10 + ch - '0';

		ch = getchar();

	}

	return x * f;

}



int n;

int h[maxn], dp[maxn];



int main()

{

	n = read();

	rep(i, 1, n) h[i] = read();

	memset(dp, 0x3f, sizeof dp);

	dp[1] = 0;

	rep(i, 1, n){

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

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

	}

	printf("%d\n", dp[n]);

	return 0;

}

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

using namespace std;

int h[100001];

int dp[100001];

int main(int argc, char const *argv[]) {

    int n;

    scanf("%d", &n);

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

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

    dp[0] = 0;

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

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

        if(i > 1)

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

    }

    printf("%d\n", dp[n-1]);

    return 0;

}
// 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.6568227895612475x):
#include<bits/stdc++.h>

using namespace std;

int h[100001];

int dp[100001];

int main(int argc, char const *argv[]) {

    int n;

    scanf("%d", &n);

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

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

    dp[0] = 0;

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

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

        if(i > 1)

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

    }

    printf("%d\n", dp[n-1]);

    return 0;

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

using namespace std;

#define ll long long int

#define dbl double

#define pi acos(-1)

#define sc1(a) scanf("%lld",&a)

#define sc2(a,b) scanf("%lld%lld",&a,&b)

#define sc3(a,b,c) scanf("%lld%lld%lld",&a,&b,&c)

#define pb push_back



ll ara[1000005];



map<ll,ll>vis;

map<ll,ll>vis1;

map<ll,ll>pos;

map<ll,ll>high;

map<ll,ll>low;

map<string,ll>mp;

vector<ll>vec;

vector<ll>v;

stack<ll>q;

string str1[100];

string str2[100];

priority_queue<ll>pq;

ll dp[1000005],t;

ll mn=1000000;

ll call(ll id)

{

    if(id==t )return 0;

    if(dp[id]!=-1)

        return dp[id];

    ll p=call(id+1)+abs(ara[id+1]-ara[id]);

    ll q=100000000;

    if(id+2!=t+1)

        q=call(id+2)+abs(ara[id+2]-ara[id]);

    dp[id]=min(p,q);

    return dp[id];



}

int main()

{



    // ll t;

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

    sc1(t);

    for(ll i=1; i<=t; i++)

    {

        sc1(ara[i]);

    }

    cout<<call(1)<<endl;

    return 0;

}


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

using namespace std;

int h[100001];

int dp[100001];

int main(int argc, char const *argv[]) {

    int n;

    scanf("%d", &n);

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

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

    dp[0] = 0;

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

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

        if(i > 1)

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

    }

    printf("%d\n", dp[n-1]);

    return 0;

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



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

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

#define fore(i, l, r) for (int i = int(l); i <= int(r); ++i)

#define ford(i, n) for (int i = int(n)-1; i >= 0; --i)

#define pb push_back

#define eb emplace_back

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

#define F first

#define S second

#define endl '\n'

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

#define de2(x,y) cout<<#x<<" = "<<(x) <<' '<< #y<<" = "<<y<<endl;



using namespace std;



typedef long long ll;

typedef pair<int, int> pii;

const int INF = 0x3f3f3f3f;

mt19937 gen(chrono::high_resolution_clock::now().time_since_epoch().count());



const int N=1e5+5;

int dp[N];

int main() {

    ios::sync_with_stdio(false);

    cin.tie(nullptr);

	int n;

	cin>>n;

	vector<int> a(n);

	for(auto& it:a) cin>>it;

	ms(dp,INF);

	dp[0]=0;

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

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

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

	}

	cout<<dp[n-1];

    return 0;

}




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

using namespace std;

int h[100001];

int dp[100001];

int main(int argc, char const *argv[]) {

    int n;

    scanf("%d", &n);

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

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

    dp[0] = 0;

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

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

        if(i > 1)

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

    }

    printf("%d\n", dp[n-1]);

    return 0;

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

using namespace std;



int a[1000001];

int dp[1000001];

int it;



int fr(int p){

	if (p==it-1){

      return 0;

    }

	if(dp[p]!=-1){

      return dp[p];

    }

	int re=abs(a[p]-a[p+1])+fr(p+1);

	if(p!=it-2){

      re=min(re,abs(a[p]-a[p+2])+fr(p+2));

    }

	return dp[p]=re;

}

int main(){

	cin>>it;

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

    cin>>a[i];

    }



	memset(dp,-1,sizeof dp);

	cout<<fr(0)<<endl;

	return 0;

}


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

using namespace std;

int h[100001];

int dp[100001];

int main(int argc, char const *argv[]) {

    int n;

    scanf("%d", &n);

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

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

    dp[0] = 0;

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

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

        if(i > 1)

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

    }

    printf("%d\n", dp[n-1]);

    return 0;

}
// Slower C++ solution:


#include <iostream>

#include <bits/stdc++.h>





using namespace std;





int a[100005], p[100005],n, i;

int respuesta(int x)

{

    if(x==n) return 0;

    if(x>n) return 1e9;

    if(p[x]!=-1)return p[x];

    return p[x]=min(abs(a[x+1]-a[x])+respuesta(x+1), abs(a[x+2]-a[x])+respuesta(x+2));

}





int main()

{

    memset(p,-1,sizeof p);

    cin>>n;

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

    {

        cin>>a[i];

    }

    cout<<respuesta(1)<<endl;

    return 0;

}


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

using namespace std;

int h[100001];

int dp[100001];

int main(int argc, char const *argv[]) {

    int n;

    scanf("%d", &n);

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

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

    dp[0] = 0;

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

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

        if(i > 1)

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

    }

    printf("%d\n", dp[n-1]);

    return 0;

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

using namespace std;

typedef long long ll;

typedef long long int lli;

typedef long double ld;

const int oo = 1e9;

const int mod = 1e9+9;

//===========================================================//

const int nax = 1e5+3;

int n;

int dp[nax];

int a[nax];

int f(int i){

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

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

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

	if(i!=n-2) ans = min(ans, abs(a[i]-a[i+2])+f(i+2));

	return dp[i]=ans;

}

int main(){

	cin>>n;

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

	memset(dp, -1, sizeof dp);

	cout<<f(0)<<endl;

	return 0;

}

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

using namespace std;

int h[100001];

int dp[100001];

int main(int argc, char const *argv[]) {

    int n;

    scanf("%d", &n);

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

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

    dp[0] = 0;

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

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

        if(i > 1)

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

    }

    printf("%d\n", dp[n-1]);

    return 0;

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

using namespace std;

typedef long long ll;

typedef long long int lli;

typedef long double ld;

const int oo = 1e9;

const int mod = 1e9+9;

/*ll gcd(ll x, ll y){return (y ? gcd(y, x%y) : x); }

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

*void exEuclid(int a, int b){

	if(b==0){x = 1; y=0; d=a; return ;}

	exEuclid(b, a%b);

	int x1=y;

	int y1=x-(a/b)*y;

	x=x1;

	y=y1;

} 

* */

//===========================================================//

const int nax = 1e5+3;

int n;

int dp[nax];

int a[nax];

int f(int i){

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

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

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

	if(i!=n-2) ans = min(ans, abs(a[i]-a[i+2])+f(i+2));

	return dp[i]=ans;

}

int main(){

	cin>>n;

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

	memset(dp, -1, sizeof dp);

	cout<<f(0)<<endl;

	return 0;

}

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

using namespace std;

int h[100001];

int dp[100001];

int main(int argc, char const *argv[]) {

    int n;

    scanf("%d", &n);

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

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

    dp[0] = 0;

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

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

        if(i > 1)

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

    }

    printf("%d\n", dp[n-1]);

    return 0;

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

using namespace std;

typedef long long ll;

ll dp[100009];

int arr[100009];

ll sum = 0;

long long Frog1(int n){

 

    if(n==0) return 0;

    else if(n==1) return abs(arr[n] - arr[n-1]);

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

    else {

            ll x = Frog1(n-1);

            ll y = Frog1(n-2);

        dp[n] = min(abs (arr[n-1] - arr[n]) + x,abs(arr[n-2] - arr[n]) + y);

        //cout << n << " = " << dp[n] << endl;

         return dp[n];

    }

}

 

 

int main()

{

    int n;

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

    cin >> n;

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

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

}

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

using namespace std;

int h[100001];

int dp[100001];

int main(int argc, char const *argv[]) {

    int n;

    scanf("%d", &n);

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

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

    dp[0] = 0;

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

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

        if(i > 1)

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

    }

    printf("%d\n", dp[n-1]);

    return 0;

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

using namespace std;

#define ll long long

#define ld long double

#define sf scanf

#define pf printf

#define pb push_back

#define llu unsigned long long

#define U unsigned int

#define SIZE 1000002

#define pie 3.14159265358979323

#define minuss 1e-6

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

 

#define BIG 100000000

 

ll  lcm(ll a,ll b)

{

    ll GCD=__gcd(a,b);

    ll lcm=(a*b)/GCD;

    return lcm;

}

ll dp[100005];

ll weight[1000005],value[1000005];

ll total,val;

ll call(ll n)

{

    if(n>=total)

        return 0;

 

    if(dp[n]!=-1)

        return dp[n];

 

    ll res1=BIG,res2=BIG;

 

   // if(weight[n]+c<=val)

    res1=abs(weight[n]-weight[n+1]) + call(n+1);

    if(n+2<=total) res2=abs(weight[n]-weight[n+2]) + call(n+2);

    //cout<<n<<" "<<res1<<" "<<res2<<endl;

    dp[n]=min(res1,res2);

    return dp[n];

 

}

int main()

{

    cin>>total;

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

        cin>>weight[i];

 

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

    ll ret=call(1);

    cout<<ret<<endl;

    return 0;

}

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

using namespace std;

int h[100001];

int dp[100001];

int main(int argc, char const *argv[]) {

    int n;

    scanf("%d", &n);

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

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

    dp[0] = 0;

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

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

        if(i > 1)

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

    }

    printf("%d\n", dp[n-1]);

    return 0;

}