stablegradients/pie-gem5-pairs huggingface dataset:
// Slower C++ solution:


#include <bits/stdc++.h>

using namespace  std;



int N;

const int SIZE = 100005;

long h [SIZE];

int mem [SIZE];



int dp (int i) {

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

  

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



  long ret = LLONG_MAX;



  if (i+1 < N) 

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

  if (i+2 < N)

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



  return  mem[i] = ret;

}



int main (){ 



  cin  >> N;

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

    cin >> h[i];

  }



  memset(mem, -1, sizeof mem);



  cout << dp(0);



}

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

//#pragma GCC optimize("Ofast")

//#pragma GCC target("avx,avx2,fma")



using namespace std;



typedef long long ll;



//#include <ext/pb_ds/assoc_container.hpp>

//#include <ext/pb_ds/tree_policy.hpp>

//using namespace __gnu_pbds;

//typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>pb_ds;



#define IN freopen("in.txt","r",stdin)

#define OUT freopen("out.txt","w",stdout)

#define pi pair<int,int>

#define F first

#define S second

#define pb push_back

#define pp pop_back

#define mod 1000000007

#define pai acos(-1)

#define N 100005



ll ar[N],dp[N];



int main ()

{

   ios_base::sync_with_stdio(false);

   cin.tie(NULL);

   int n;cin>>n;

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

   dp[n]=0;

   for(int i=n-1;i>=1;i--){

      dp[i]=min(dp[i+1]+abs(ar[i]-ar[i+1]),(i+2<=n)?dp[i+2]+abs(ar[i]-ar[i+2]):INT_MAX);

   }

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

   return 0;

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

#define maxn 100005

using namespace std;



int main(){

    int n;

    cin >> n;

    int h[maxn];

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

        cin >> h[i];

    }

    int dp[maxn];

    fill(dp, dp+maxn, 0x7fffffff);

    dp[0] = 0;

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

        int temp = 0;

        if(i+1 < n){

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

            if(temp < dp[i+1])

                dp[i+1] = temp;

        }

        if(i+2 < n){

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

            if(temp < dp[i+2])

                dp[i+2] = temp;

        }

    }

    cout << dp[n-1];

    return 0;

}


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

//#pragma GCC optimize("Ofast")

//#pragma GCC target("avx,avx2,fma")



using namespace std;



typedef long long ll;



//#include <ext/pb_ds/assoc_container.hpp>

//#include <ext/pb_ds/tree_policy.hpp>

//using namespace __gnu_pbds;

//typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>pb_ds;



#define IN freopen("in.txt","r",stdin)

#define OUT freopen("out.txt","w",stdout)

#define pi pair<int,int>

#define F first

#define S second

#define pb push_back

#define pp pop_back

#define mod 1000000007

#define pai acos(-1)

#define N 100005



ll ar[N],dp[N];



int main ()

{

   ios_base::sync_with_stdio(false);

   cin.tie(NULL);

   int n;cin>>n;

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

   dp[n]=0;

   for(int i=n-1;i>=1;i--){

      dp[i]=min(dp[i+1]+abs(ar[i]-ar[i+1]),(i+2<=n)?dp[i+2]+abs(ar[i]-ar[i+2]):INT_MAX);

   }

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

   return 0;

}
// Slower C++ solution:
#define _CRT_SECURE_NO_WARNINGS

#include<bits/stdc++.h>

#define rep(i,a,n) for (int i=a;i<n;i++)

#define per(i,a,n) for (int i=n-1;i>=a;i--)

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

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

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

#define fi first

#define se second

#define pp push_back

#define pb pop_back

#define pi 3.141592654

#define MOD 1000000007 

#define cons1 1e12

#define cons2 1e6

using namespace std;

typedef long long ll;

typedef vector<int> vi;

typedef pair<int, int> pa;

typedef unsigned long long int ull;

typedef double long dl;

const int N = 1e5+9;

int n;

int v[N], ans[N];

int sol(int i) {

	if (ans[i] == -1) {

		if (i == n - 1)

			ans[i] = 0;

		else if (i == n - 2)

			ans[i] = abs(v[i] - v[i + 1]);

		else 

			ans[i] = min(abs(v[i] - v[i + 1])+sol(i + 1)

				, abs(v[i] - v[i + 2]) + sol(i + 2));

		

	}

	return ans[i];

	

}

void solve() {

	clr(ans, -1);

	cin >> n;

	rep(i, 0, n)

		cin >> v[i];

	cout << sol(0) << endl;

}

int main() {

	ios::sync_with_stdio(0);

	cin.tie(NULL);

	cout.tie(NULL);

	int t = 1;

	//cin >> t;

	while (t--)

		solve();



#ifndef ONLINE_JUDGE

	- system("pause");

#endif



}

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

//#pragma GCC optimize("Ofast")

//#pragma GCC target("avx,avx2,fma")



using namespace std;



typedef long long ll;



//#include <ext/pb_ds/assoc_container.hpp>

//#include <ext/pb_ds/tree_policy.hpp>

//using namespace __gnu_pbds;

//typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>pb_ds;



#define IN freopen("in.txt","r",stdin)

#define OUT freopen("out.txt","w",stdout)

#define pi pair<int,int>

#define F first

#define S second

#define pb push_back

#define pp pop_back

#define mod 1000000007

#define pai acos(-1)

#define N 100005



ll ar[N],dp[N];



int main ()

{

   ios_base::sync_with_stdio(false);

   cin.tie(NULL);

   int n;cin>>n;

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

   dp[n]=0;

   for(int i=n-1;i>=1;i--){

      dp[i]=min(dp[i+1]+abs(ar[i]-ar[i+1]),(i+2<=n)?dp[i+2]+abs(ar[i]-ar[i+2]):INT_MAX);

   }

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

   return 0;

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

//#pragma GCC optimize("Ofast")

//#pragma GCC target("avx,avx2,fma")



using namespace std;



typedef long long ll;



//#include <ext/pb_ds/assoc_container.hpp>

//#include <ext/pb_ds/tree_policy.hpp>

//using namespace __gnu_pbds;

//typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>pb_ds;



#define IN freopen("in.txt","r",stdin)

#define OUT freopen("out.txt","w",stdout)

#define pi pair<int,int>

#define F first

#define S second

#define pb push_back

#define pp pop_back

#define mod 1000000007

#define pai acos(-1)

#define N 100005



ll ar[N],dp[N];



int main ()

{

   ios_base::sync_with_stdio(false);

   cin.tie(NULL);

   int n;cin>>n;

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

   dp[n]=0;

   for(int i=n-1;i>=1;i--){

      dp[i]=min(dp[i+1]+abs(ar[i]-ar[i+1]),(i+2<=n)?dp[i+2]+abs(ar[i]-ar[i+2]):INT_MAX);

   }

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

   return 0;

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

//#pragma GCC optimize("Ofast")

//#pragma GCC target("avx,avx2,fma")



using namespace std;



typedef long long ll;



//#include <ext/pb_ds/assoc_container.hpp>

//#include <ext/pb_ds/tree_policy.hpp>

//using namespace __gnu_pbds;

//typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>pb_ds;



#define IN freopen("in.txt","r",stdin)

#define OUT freopen("out.txt","w",stdout)

#define pi pair<int,int>

#define F first

#define S second

#define pb push_back

#define pp pop_back

#define mod 1000000007

#define pai acos(-1)

#define N 100005



ll ar[N],dp[N];



int main ()

{

   ios_base::sync_with_stdio(false);

   cin.tie(NULL);

   int n;cin>>n;

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

   dp[n]=0;

   for(int i=n-1;i>=1;i--){

      dp[i]=min(dp[i+1]+abs(ar[i]-ar[i+1]),(i+2<=n)?dp[i+2]+abs(ar[i]-ar[i+2]):INT_MAX);

   }

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

   return 0;

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

//#pragma GCC optimize("Ofast")

//#pragma GCC target("avx,avx2,fma")



using namespace std;



typedef long long ll;



//#include <ext/pb_ds/assoc_container.hpp>

//#include <ext/pb_ds/tree_policy.hpp>

//using namespace __gnu_pbds;

//typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>pb_ds;



#define IN freopen("in.txt","r",stdin)

#define OUT freopen("out.txt","w",stdout)

#define pi pair<int,int>

#define F first

#define S second

#define pb push_back

#define pp pop_back

#define mod 1000000007

#define pai acos(-1)

#define N 100005



ll ar[N],dp[N];



int main ()

{

   ios_base::sync_with_stdio(false);

   cin.tie(NULL);

   int n;cin>>n;

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

   dp[n]=0;

   for(int i=n-1;i>=1;i--){

      dp[i]=min(dp[i+1]+abs(ar[i]-ar[i+1]),(i+2<=n)?dp[i+2]+abs(ar[i]-ar[i+2]):INT_MAX);

   }

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

   return 0;

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

//#pragma GCC optimize("Ofast")

//#pragma GCC target("avx,avx2,fma")



using namespace std;



typedef long long ll;



//#include <ext/pb_ds/assoc_container.hpp>

//#include <ext/pb_ds/tree_policy.hpp>

//using namespace __gnu_pbds;

//typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>pb_ds;



#define IN freopen("in.txt","r",stdin)

#define OUT freopen("out.txt","w",stdout)

#define pi pair<int,int>

#define F first

#define S second

#define pb push_back

#define pp pop_back

#define mod 1000000007

#define pai acos(-1)

#define N 100005



ll ar[N],dp[N];



int main ()

{

   ios_base::sync_with_stdio(false);

   cin.tie(NULL);

   int n;cin>>n;

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

   dp[n]=0;

   for(int i=n-1;i>=1;i--){

      dp[i]=min(dp[i+1]+abs(ar[i]-ar[i+1]),(i+2<=n)?dp[i+2]+abs(ar[i]-ar[i+2]):INT_MAX);

   }

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

   return 0;

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

//#pragma GCC optimize("Ofast")

//#pragma GCC target("avx,avx2,fma")



using namespace std;



typedef long long ll;



//#include <ext/pb_ds/assoc_container.hpp>

//#include <ext/pb_ds/tree_policy.hpp>

//using namespace __gnu_pbds;

//typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>pb_ds;



#define IN freopen("in.txt","r",stdin)

#define OUT freopen("out.txt","w",stdout)

#define pi pair<int,int>

#define F first

#define S second

#define pb push_back

#define pp pop_back

#define mod 1000000007

#define pai acos(-1)

#define N 100005



ll ar[N],dp[N];



int main ()

{

   ios_base::sync_with_stdio(false);

   cin.tie(NULL);

   int n;cin>>n;

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

   dp[n]=0;

   for(int i=n-1;i>=1;i--){

      dp[i]=min(dp[i+1]+abs(ar[i]-ar[i+1]),(i+2<=n)?dp[i+2]+abs(ar[i]-ar[i+2]):INT_MAX);

   }

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

   return 0;

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

//#pragma GCC optimize("Ofast")

//#pragma GCC target("avx,avx2,fma")



using namespace std;



typedef long long ll;



//#include <ext/pb_ds/assoc_container.hpp>

//#include <ext/pb_ds/tree_policy.hpp>

//using namespace __gnu_pbds;

//typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>pb_ds;



#define IN freopen("in.txt","r",stdin)

#define OUT freopen("out.txt","w",stdout)

#define pi pair<int,int>

#define F first

#define S second

#define pb push_back

#define pp pop_back

#define mod 1000000007

#define pai acos(-1)

#define N 100005



ll ar[N],dp[N];



int main ()

{

   ios_base::sync_with_stdio(false);

   cin.tie(NULL);

   int n;cin>>n;

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

   dp[n]=0;

   for(int i=n-1;i>=1;i--){

      dp[i]=min(dp[i+1]+abs(ar[i]-ar[i+1]),(i+2<=n)?dp[i+2]+abs(ar[i]-ar[i+2]):INT_MAX);

   }

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

   return 0;

}
// 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.7903473262505925x):


#include<bits/stdc++.h>

#define lld         long long int

#define llf         long double

#define pb          push_back

#define mp          make_pair

#define IN          insert

#define loopN(n)    for(lld i=0;i<n;i++)

#define loop(p,n)   for(lld i=p;i<=n;i++)

#define rloop(p,n)  for(lld i=n;i>=p;i--)

#define loop2(p,n)  for(lld j=p;j<=n;j++)

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

#define F1          first

#define F2          second

#define INF         2e18

#define FILE        freopen("input.txt","r",stdin);freopen("output.txt","w",stdout)

#define PI          2*acos(0.0)

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

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

#define case(z)     cout<<"Case "<<z<<": ";

using namespace std;

const lld mod=1e9+7;



lld n;

lld a[100005];

lld dp[100005];



lld fun(lld p)

{



    if(p==n-1)

    {

        return 0;

    }

    if(p==n-2)

    {

        return abs(a[p]-a[p+1]);

    }

    if(dp[p]!=-1)

    {

        return dp[p];

    }

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





}



int main()

{

    ISO;



    //lld t;cin>>t;while(t--)

    mem(dp,-1);

    cin>>n;

    loopN(n)cin>>a[i];

    cout<<fun(0)<<endl;



    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.182111098138242x):


#include<bits/stdc++.h>

#define lld         long long int

#define llf         long double

#define pb          push_back

#define mp          make_pair

#define IN          insert

#define loopN(n)    for(lld i=0;i<n;i++)

#define loop(p,n)   for(lld i=p;i<=n;i++)

#define rloop(p,n)  for(lld i=n;i>=p;i--)

#define loop2(p,n)  for(lld j=p;j<=n;j++)

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

#define F1          first

#define F2          second

#define INF         2e18

#define FILE        freopen("input.txt","r",stdin);freopen("output.txt","w",stdout)

#define PI          2*acos(0.0)

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

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

#define case(z)     cout<<"Case "<<z<<": ";

using namespace std;

const lld mod=1e9+7;



lld n;

lld a[100005];

lld dp[100005];



lld fun(lld p)

{



    if(p==n-1)

    {

        return 0;

    }

    if(p==n-2)

    {

        return abs(a[p]-a[p+1]);

    }

    if(dp[p]!=-1)

    {

        return dp[p];

    }

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





}



int main()

{

    ISO;



    //lld t;cin>>t;while(t--)

    mem(dp,-1);

    cin>>n;

    loopN(n)cin>>a[i];

    cout<<fun(0)<<endl;



    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.214054919192018x):


#include<bits/stdc++.h>

#define lld         long long int

#define llf         long double

#define pb          push_back

#define mp          make_pair

#define IN          insert

#define loopN(n)    for(lld i=0;i<n;i++)

#define loop(p,n)   for(lld i=p;i<=n;i++)

#define rloop(p,n)  for(lld i=n;i>=p;i--)

#define loop2(p,n)  for(lld j=p;j<=n;j++)

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

#define F1          first

#define F2          second

#define INF         2e18

#define FILE        freopen("input.txt","r",stdin);freopen("output.txt","w",stdout)

#define PI          2*acos(0.0)

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

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

#define case(z)     cout<<"Case "<<z<<": ";

using namespace std;

const lld mod=1e9+7;



lld n;

lld a[100005];

lld dp[100005];



lld fun(lld p)

{



    if(p==n-1)

    {

        return 0;

    }

    if(p==n-2)

    {

        return abs(a[p]-a[p+1]);

    }

    if(dp[p]!=-1)

    {

        return dp[p];

    }

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





}



int main()

{

    ISO;



    //lld t;cin>>t;while(t--)

    mem(dp,-1);

    cin>>n;

    loopN(n)cin>>a[i];

    cout<<fun(0)<<endl;



    return 0;

}