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

using namespace std;

int a,b,c,d,dp[100000],cost[100000],weight[100];



void func(int a)

{

    dp[1]=0;

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

    for(int i=3; i<=a; i++)

    {

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

    }

}



int main()

{

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

    cin>>a;

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

    {

        cin>>cost[i];

    }

    func(a);

    cout<<dp[a]<<endl;

    //cout<<nCr(a,b)<<endl;



}


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

using namespace std;

#define ll long long



int main(){

    ll n;

    cin >> n;

    vector<ll> dp(n,1e18);

    ll i,j;

    dp[0]=0;

    ll h[n];

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

        cin >> h[i];

    }

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

        if((i+1) < n){

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

        }

        if((i+2) < n){

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

        }

    }

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

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

#define F first

#define S second

#define T second.first

#define C second.second

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

using namespace std;

typedef long long ll;

typedef pair<int, int> pii;

typedef pair<int,pair<int,int>> piii;



const int N= 1e5+5, L = 14, OO = 0x3f3f3f3f;

const ll M=10 ;

const double ESP = 1e-8;



int n;

int A[N], dp[N];

int main(){

    FIO

//    freopen("input.txt", "r", stdin);

//    freopen("output.txt", "w", stdout);

    cin>>n;

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

    memset(dp, OO, sizeof dp);

    dp[0] = 0;

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

        if(i+1<n){

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

        }

        if(i+2<n){

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

        }

    }

    cout<<dp[n-1];



}


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

using namespace std;

#define ll long long



int main(){

    ll n;

    cin >> n;

    vector<ll> dp(n,1e18);

    ll i,j;

    dp[0]=0;

    ll h[n];

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

        cin >> h[i];

    }

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

        if((i+1) < n){

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

        }

        if((i+2) < n){

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

        }

    }

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

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



using namespace std;

typedef long long ll;

typedef double dd;

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

#define endl "\n"

#define clr(n, r) memset(n,r,sizeof(n));



void fast() {



    cin.tie(0);

    cin.sync_with_stdio(0);

}



const int N = 1e5 + 9;

int n, h[N], dp[N];



int sol(int i){

    if(i<0) return 1e9;

    if(i==0) return 0;



    if(~dp[i]) return dp[i];



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

}





int main() {



    cin >> n;



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



    memset(dp, -1, sizeof dp);



    cout << sol(n - 1);

}

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

using namespace std;

#define ll long long



int main(){

    ll n;

    cin >> n;

    vector<ll> dp(n,1e18);

    ll i,j;

    dp[0]=0;

    ll h[n];

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

        cin >> h[i];

    }

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

        if((i+1) < n){

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

        }

        if((i+2) < n){

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

        }

    }

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

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

#include <ext/numeric>



using namespace std;

using namespace __gnu_cxx;



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

#define endl "\n"

#define pb push_back

#define F first

#define S second

#define THINK_TWICE_CODE_ONCE cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0);

#define isOdd(n)    (n&1)

#define LLMAX LLONG_MAX

#define LLMIN LLONG_MIN

#define IMN INT_MIN

#define IMX INT_MAX

#define pow(n, m) power((ll)n, (ll)m)

#define numOfDigits(n)  ((n)? (ll)(log10(n)+1) : 1)

#define mem(x, val)    memset(x, val, sizeof(x))



typedef long long ll;

typedef long double ld;

typedef double dd;

typedef string str;

typedef pair<int, int> pii;





vector<int> v;

int dp[(int)1e5];

int n;

int jump(int i){

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

    if(i>=n) return 1e9;



    int &ret = dp[i];



    if(~ret) return ret;



    int cnt = 0;

    if(i+1<n) cnt = abs(v[i] - v[i+1]) + jump(i+1);

    if(i+2<n) cnt = min(cnt, abs(v[i] - v[i+2]) + jump(i+2));



    return ret = cnt;

}

int main()

{

    THINK_TWICE_CODE_ONCE

    //freopen("test cases\\.txt", "r", stdin) ;

    cin>>n;

    v.resize(n);

    for(int &i: v) cin>>i;

    mem(dp, -1);

    cout<<jump(0);

    return 0;

}










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

using namespace std;

#define ll long long



int main(){

    ll n;

    cin >> n;

    vector<ll> dp(n,1e18);

    ll i,j;

    dp[0]=0;

    ll h[n];

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

        cin >> h[i];

    }

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

        if((i+1) < n){

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

        }

        if((i+2) < n){

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

        }

    }

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

}
// Slower C++ solution:
/*

				" اللهم صلي و سلم علي سيدنا محمد و علي اله وصحبه اجمعين "

*/





#define _CRT_SECURE_NO_WARNINGS

#include<bits/stdc++.h>

#define f for

#define ll long long

#define ull unsigned long long

#define endl "\n"

using namespace std;

#define BI  acos(-1)

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

void Open()

{

#ifndef ONLINE_JUDGE

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

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

#endif

}

ll gcd(ll a, ll b)

{

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

}

void madesetprobblem()

{

	//$ $

	//less than or equal => $ 1 \leq 100 $

	//  $(1 \le A,B \le 10^5 )$

	// a[i] => $a_i$

	// a[i][j] => $a_{i,j}$

	// double qoutes ''yext''

	/*

		image

		\begine{center}

		\includegraphics{image.jpg}

		\end{center}

	*/

	/*

		list

		\begin{itemize}

			\item first one

			\item second one

		\end{itemize}

	*/

}

int n;

vector<int>a(1e5 + 2),dp(1e5+2,-1);

int ans(int c = 0)

{

	if (c == n-1)

		return 0;

	int ans1 = INT_MAX, ans2 = INT_MAX;

	if (dp[c] != -1)

		ans1 = dp[c];

	else

	{

		if (c + 1 < n)

			ans1 = (abs(a[c] - a[c + 1]) + ans(c + 1));

		if (c + 2 < n)

			ans2 = (abs(a[c] - a[c + 2]) + ans(c + 2));

		dp[c] = min(ans1, ans2);

	}

	//cout <<c<<" "<< ans1 << " " << ans2 << endl;

	return min(ans1,ans2);

}

int main()

{

	// توكلت علي الله 

//Open();

	ios::sync_with_stdio(false);

	cin.tie(NULL);

	cout.tie(NULL);

	cin >> n;

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

	{

		cin >> a[i];

	}

	cout << ans();

}

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

using namespace std;

#define ll long long



int main(){

    ll n;

    cin >> n;

    vector<ll> dp(n,1e18);

    ll i,j;

    dp[0]=0;

    ll h[n];

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

        cin >> h[i];

    }

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

        if((i+1) < n){

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

        }

        if((i+2) < n){

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

        }

    }

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

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

//freopen("transmitters.in","r",stdin);

//cout<<fixed<<setprecision(6)<<n<<endl;

// transform(s.begin(), s.end(), s.begin(), ::tolower);

//double PI=3.14159265359,c=0;

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

#define endl '\n'

#define ll long long

//#define f(n) for(int i=;i<n;i++)

double PI = acos(-1);

using namespace std;

void fast()

{

	std::ios_base::sync_with_stdio(0);

	cin.tie(0);

	cout.tie(0);

}

int arr[1000005], n;

vector<int>v(1e5+2, -1);

int minCost(int indx)

{

	int path1=INT_MAX, path2=INT_MAX;

	if (indx == n - 1)

		return 0;



	if (v[indx] != -1)

		return v[indx];



	if (indx + 1 < n)

		path1 = abs(arr[indx] - arr[indx + 1]) + minCost(indx + 1);



	if (indx + 2 < n)

		path2 = abs(arr[indx] - arr[indx + 2]) + minCost(indx + 2);



	return v[indx] = min(path1, path2);

}

int main()

{

	fast();

	cin >> n;

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

		cin >> arr[i];



	cout << minCost(0) << endl;



	return 0;

}

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

using namespace std;

#define ll long long



int main(){

    ll n;

    cin >> n;

    vector<ll> dp(n,1e18);

    ll i,j;

    dp[0]=0;

    ll h[n];

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

        cin >> h[i];

    }

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

        if((i+1) < n){

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

        }

        if((i+2) < n){

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

        }

    }

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

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

using namespace std;



const int N=1e5+30;

typedef long long ll;

int n,arr[N];

int dp[N];

ll solve(int i){

    if(i>=n)return 1e15;

    if(i==n-1){

        return 0;

    }



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



    ll path1=abs(arr[i]-arr[i+1])+solve(i+1);

    ll path2=abs(arr[i]-arr[i+2])+solve(i+2);

    return dp[i]= min(path1,path2);

}

int main()

{

    memset(dp,-1,sizeof dp);

    scanf("%d",&n);

    for(int i=0;i<n;i++)scanf("%d",arr+i);

    cout<<solve(0)<<endl;

}




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

using namespace std;

#define ll long long



int main(){

    ll n;

    cin >> n;

    vector<ll> dp(n,1e18);

    ll i,j;

    dp[0]=0;

    ll h[n];

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

        cin >> h[i];

    }

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

        if((i+1) < n){

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

        }

        if((i+2) < n){

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

        }

    }

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

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

#include <cmath>

#include <cstring>

using namespace std;



int n;

int ht[100010];

int eg[100010];//eg[i] 代表到达i点消耗的最少能量 

int main(){

	cin>>n;

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

		cin>>ht[i];

		

	}//读取完毕

	memset(eg, 0, sizeof(eg));

	eg[2] = abs(ht[2]- ht[1]);

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

		int t1 = abs(ht[i] - ht[i-1]);

		int t2 = abs(ht[i] - ht[i-2]);

		eg[i] = min(eg[i-1]+t1, eg[i-2]+t2); 

	}

	cout<<eg[n]<<endl;

		

}

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

using namespace std;

#define ll long long



int main(){

    ll n;

    cin >> n;

    vector<ll> dp(n,1e18);

    ll i,j;

    dp[0]=0;

    ll h[n];

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

        cin >> h[i];

    }

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

        if((i+1) < n){

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

        }

        if((i+2) < n){

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

        }

    }

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

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

#define _CRT_SECURE_NO_WARNINGS

#include <bits/stdc++.h>

#include <unordered_set>

#include <unordered_map>



using namespace std;



typedef long long ll;

typedef long long ull;

typedef pair<ll, ll> ii;



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

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

#define endl		"\n"

#define fx(n)		fixed<<setprecision(n)

#define mk			make_pair	



void File()

{

#ifndef ONLINE_JUDGE

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

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

#endif

#ifdef ONLINE_JUDGE

	/*freopen("output.txt", "w", stdout);

	freopen("pyramid.in", "r", stdin);*/

#endif

}

void fast()

{

	ios::sync_with_stdio(NULL);

	cout.tie(NULL);

	cin.tie(NULL);

	//File();

}

const double pi = 2 * acos(0.0);

const ll oo = 0x3f3f3f3f;

const int MOD = 1e9 + 7;

const int nn = 1e5 + 15;

int dx[8] = { 1, -1, 0, 0, 1, -1, 1, -1 };

int dy[8] = { 0, 0, 1, -1, 1, -1, -1, 1 };



int n;

ll arr[nn];

ll dp[nn];

int main()

{

	fast();

	cin >> n;

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

		cin >> arr[i];

	memset(dp, oo, sizeof dp);

	dp[0] = 0;

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

	{

		if (i == 1)

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

		else

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

	}

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

	return 0;

}

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

using namespace std;

#define ll long long



int main(){

    ll n;

    cin >> n;

    vector<ll> dp(n,1e18);

    ll i,j;

    dp[0]=0;

    ll h[n];

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

        cin >> h[i];

    }

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

        if((i+1) < n){

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

        }

        if((i+2) < n){

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

        }

    }

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

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

    

using namespace std;

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

vector<long long>num;

long long  erg(int n){

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

		return dp[n];

	}

	if(n<0){

		return 2000000000000;

	}

	if(n==0){

		return 0;

	}

	long long cmp1=max(num[n],num[n-1])-min(num[n],num[n-1]),cmp2=max(num[n],num[n-2])-min(num[n],num[n-2]);

	dp[n]= min(erg(n-1)+cmp1,erg(n-2)+cmp2);

	return dp[n];

}

int main() {

	int menge,numm;

	cin>>menge;

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

		cin>>numm;

		num.push_back(numm);

	}

cout<<erg(menge-1);

    return 0;

}

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

using namespace std;

#define ll long long



int main(){

    ll n;

    cin >> n;

    vector<ll> dp(n,1e18);

    ll i,j;

    dp[0]=0;

    ll h[n];

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

        cin >> h[i];

    }

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

        if((i+1) < n){

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

        }

        if((i+2) < n){

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

        }

    }

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

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

#define ll long long

using namespace std;



ll n;

std::vector<ll> ara(100010);

ll dp[100010];



ll fnc(ll i){

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

  if(i == n)return 1<<30;

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

  ll res1 = abs(ara[i]-ara[i+1]) + fnc(i+1);

  ll res2 = abs(ara[i]-ara[i+2]) + fnc(i+2);

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

  return min(res1,res2);

}



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

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

  cin >> n;

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

    cin >> ara[i];

  }

  cout << fnc(0) << endl;



  return 0;

}


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

using namespace std;

#define ll long long



int main(){

    ll n;

    cin >> n;

    vector<ll> dp(n,1e18);

    ll i,j;

    dp[0]=0;

    ll h[n];

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

        cin >> h[i];

    }

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

        if((i+1) < n){

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

        }

        if((i+2) < n){

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

        }

    }

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

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

using namespace std;

typedef long long ll;

typedef unsigned long long ull;

#define     FasterIO        ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);

#define     bug(a,b)        cout<<a<<"\t"<<b<<"\n";

#define     Case(a,b)       cout<<"Case "<<a<<": "<<b<<"\n";

#define     watch(a)        cout<<fixed<<setprecision(a)

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

#define     Endl            "\n";

#define     tab             "\t"

#define     reset(a,b)      memset(a,b,sizeof(a));

#define     sf(a)           scanf(" %d", &a);

#define     srt(a)          sort(a.begin(),a.end());

#define     pi              2*acos(0.0)

#define     inf             INT_MAX

const int sz=1e5+9;

int n,x,arr[sz],dp[sz];



int clac(int i){

    if(i==n) return 0;

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

    int left=abs(arr[i]-arr[i+1])+clac(i+1);

    int right=inf;

    if(i+2<=n){

        right=abs(arr[i]-arr[i+2])+clac(i+2);

    }

    return dp[i]=min(left,right);

}









void solve(){



    cin>>n;





    reset(dp,-1);

    //bug(n,dp[n]);

    lp(i,1,n+1)cin>>arr[i];

    cout<<clac(1)<<"\n";



}



int main(){

    //FasterIO;

   // #ifndef ONLINE_JUDGE

      //  freopen("1.txt","r",stdin);

   // #endif

    //int t;

    //cin>>t;

    //while(t--)

        solve();

}


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

using namespace std;

#define ll long long



int main(){

    ll n;

    cin >> n;

    vector<ll> dp(n,1e18);

    ll i,j;

    dp[0]=0;

    ll h[n];

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

        cin >> h[i];

    }

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

        if((i+1) < n){

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

        }

        if((i+2) < n){

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

        }

    }

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

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

using namespace std;

typedef long long ll;

typedef unsigned long long ull;

#define     FasterIO        ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);

#define     bug(a,b)        cout<<a<<"\t"<<b<<"\n";

#define     Case(a,b)       cout<<"Case "<<a<<": "<<b<<"\n";

#define     watch(a)        cout<<fixed<<setprecision(a)

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

#define     Endl            "\n";

#define     tab             "\t"

#define     reset(a,b)      memset(a,b,sizeof(a));

#define     sf(a)           scanf(" %d", &a);

#define     srt(a)          sort(a.begin(),a.end());

#define     pi              2*acos(0.0)

#define     inf             INT_MAX

const int sz=1e5+9;

int n,x,arr[sz],dp[sz];



int clac(int i){

    if(i==n) return 0;

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

    int left=abs(arr[i]-arr[i+1])+clac(i+1);

    int right=inf;

    if(i+2<=n){

        right=abs(arr[i]-arr[i+2])+clac(i+2);

    }

    return dp[i]=min(left,right);

}



void solve(){

    cin>>n;

    reset(dp,-1);

    lp(i,1,n+1)cin>>arr[i];

    cout<<clac(1)<<"\n";

}



int main(){

    //FasterIO;

    #ifndef ONLINE_JUDGE

       // freopen("1.txt","r",stdin);

   #endif

   // int t;

    //cin>>t;

    //while(t--)

        solve();

}


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

using namespace std;

#define ll long long



int main(){

    ll n;

    cin >> n;

    vector<ll> dp(n,1e18);

    ll i,j;

    dp[0]=0;

    ll h[n];

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

        cin >> h[i];

    }

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

        if((i+1) < n){

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

        }

        if((i+2) < n){

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

        }

    }

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

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

#include <ext/pb_ds/assoc_container.hpp>

#include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;

using namespace std;

#define DEBUG

#ifdef DEBUG

#define debug(...) __f(#__VA_ARGS__, __VA_ARGS__)

	template <typename Arg1>

	void __f(const char* name, Arg1&& arg1){

		cerr << name << " : " << arg1 << std::endl;

	}

	template <typename Arg1, typename... Args>

	void __f(const char* names, Arg1&& arg1, Args&&... args){

		const char* comma = strchr(names + 1, ','); cerr.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...);

	}

#else

#define debug(...)

#endif

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

#define RFOR(i,a,b) 	for(int i=a;i>=b;--i)

#define ln 		"\n"

#define mp make_pair

#define pb push_back

#define sz(a)	ll(a.size())

#define F first

#define S second

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

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

#define trace(c,x) for(auto &x:c)

#define pii pair<ll,ll>

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

typedef long long ll;

typedef long double ld;

typedef	priority_queue<pii,std::vector<pii>,greater<pii> > revpr;



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

// ordered_set X

//K-th smallest

//*X.find_by_order(k-1)

//NO OF ELEMENTS < A

//X.order_of_key(A)

const int L=1e6+7;

ll n, h[L], dp[L];

ll solve(int i)

{

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

	if(i>=n)return INT_MAX;

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

	ll &ret = dp[i];

	ret = INT_MAX;

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

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

	return ret;

}

void fff()

{

	cin >> n;

	init(dp, -1);

	FOR(i,0,n)cin >> h[i];

	cout<<solve(0)<<ln;

}

int main()

{

	ios_base::sync_with_stdio(false);

	cin.tie(NULL);

	cout.tie(NULL);

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

	fff();

	return 0;

}

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

using namespace std;

#define ll long long



int main(){

    ll n;

    cin >> n;

    vector<ll> dp(n,1e18);

    ll i,j;

    dp[0]=0;

    ll h[n];

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

        cin >> h[i];

    }

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

        if((i+1) < n){

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

        }

        if((i+2) < n){

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

        }

    }

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

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

#define f(i,s,v) for(int i=(int)s;i<(int)v;++i)

#define rf(i,s,v) for(int i=(int)s-1;i>(int)v;--i)

#define pb push_back

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

#define memset(c, value) memset(c, (int)value, sizeof(c))

using namespace std;

typedef long long ll;

const int oo = 1e9;

const ll MOD =1e9+7;

void fast(){

    ios_base :: sync_with_stdio(0);

    cin.tie(0);

    cout.tie(0);

}

int n;

int h[100005];

bool valid (int r,int c){

    return (r < n && r >= 0 && c >= 0 && c < n);

}

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

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

int vis[100002];

int dp(int i){

    if(i == n-1)

        return 0;

    int &ret = vis[i];

    if(ret != -1)

        return ret;



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

    if(i+2 < n)

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

    return ret = path1;

}



int main()

{

    fast();

    memset(vis, -1);

    cin>>n;

    f(i,0,n)

        cin>>h[i];

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

    return 0;

}


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

using namespace std;

#define ll long long



int main(){

    ll n;

    cin >> n;

    vector<ll> dp(n,1e18);

    ll i,j;

    dp[0]=0;

    ll h[n];

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

        cin >> h[i];

    }

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

        if((i+1) < n){

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

        }

        if((i+2) < n){

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

        }

    }

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

}