stablegradients/pie-gem5-pairs huggingface dataset:
// 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.3868327312116417x):
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int maxN = 2e5 + 10;



int main(){

//  freopen("abc.inp", "r", stdin); freopen("abc.out", "w", stdout);

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

  int n; cin >> n;

  vector<int> h(n+1);

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

    cin >> h[i];

  }

  int inf = 1 << 30;

  vector<int> dp(n+1, inf);

  dp[1] = 0;

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

    for (int j = i + 1; j <= n && j - i < 3; ++j) {

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

    }

  }

  cout << dp[n];

return 0;

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

#include<cstring>

#include<algorithm>





using namespace std;



const long long inf= 1e10+ 123;

const int mx=1e5+123;

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



int solve( int i)

{

    if(i==n)

        return 0;



    if(dp[i]!= -1)

        return dp[i];



    int ret1, ret2;

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

    if(i+2<=n)

        ret2= abs(h[i]- h[i+2])+ solve(i+2);

    else

        ret2= inf;

    return dp[i]=min(ret1, ret2);

}



int main()

{

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



    cin>> n;

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

        cin>> h[i];



    cout<< solve(1)<< endl;



    return 0;

}


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

using namespace std;

typedef long long ll;

const int maxN = 2e5 + 10;



int main(){

//  freopen("abc.inp", "r", stdin); freopen("abc.out", "w", stdout);

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

  int n; cin >> n;

  vector<int> h(n+1);

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

    cin >> h[i];

  }

  int inf = 1 << 30;

  vector<int> dp(n+1, inf);

  dp[1] = 0;

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

    for (int j = i + 1; j <= n && j - i < 3; ++j) {

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

    }

  }

  cout << dp[n];

return 0;

}
// Slower C++ solution:
/*

** author:mahmoud magdy

*/

#include <bits/stdc++.h>

using namespace std;



#define ll long long

#define endl "\n"



inline int D()

{

    int m ;

    cin>>m;

    return m ;

}

inline ll lD()

{

    ll m ;

    cin>>m;

    return m ;

}

inline double dD()

{

    double m;

    cin>>m;

    return m;

}

void fast()

{

    ios_base :: sync_with_stdio( 0 ) ;

    cin.tie( 0 ) ;

    cout.tie( 0 ) ;

}

int a[100005];

int dp[100005];

int n;

int solve(int i){

 if(i>=n)return 1e9;

 if(i==n-1)

    return 0;

 if(dp[i]!=-1)

      return dp[i];

 int ch1=abs(a[i]-a[i+1])+solve(i+1);

 int ch2=abs(a[i]-a[i+2])+solve(i+2);

 return dp[i]=min(ch1,ch2);

}

int main()

{

    fast();

    n=D();

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

        a[i]=D();

    }

    memset(dp,-1,sizeof dp);

    cout<<solve(0)<<endl;

}


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

using namespace std;

typedef long long ll;

const int maxN = 2e5 + 10;



int main(){

//  freopen("abc.inp", "r", stdin); freopen("abc.out", "w", stdout);

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

  int n; cin >> n;

  vector<int> h(n+1);

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

    cin >> h[i];

  }

  int inf = 1 << 30;

  vector<int> dp(n+1, inf);

  dp[1] = 0;

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

    for (int j = i + 1; j <= n && j - i < 3; ++j) {

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

    }

  }

  cout << dp[n];

return 0;

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

using namespace std;

const int N = 1e5+1;



vector<int> v(N, 0);

vector<int> memo(N, -1);



int cost(int pos, int n){

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

    else if (pos == n) return 0;

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

    else {

        memo[pos] = min(abs(v[pos] - v[pos + 1]) + cost(pos+1, n), abs(v[pos]-v[pos + 2]) + cost(pos+2, n));

        return memo[pos];

    }

}



int main(){

    int n; cin >> n;

    

    for (int i = 1; i!=n+1; i++) cin >> v[i];

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



    return 0;

}

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

using namespace std;

typedef long long ll;

const int maxN = 2e5 + 10;



int main(){

//  freopen("abc.inp", "r", stdin); freopen("abc.out", "w", stdout);

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

  int n; cin >> n;

  vector<int> h(n+1);

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

    cin >> h[i];

  }

  int inf = 1 << 30;

  vector<int> dp(n+1, inf);

  dp[1] = 0;

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

    for (int j = i + 1; j <= n && j - i < 3; ++j) {

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

    }

  }

  cout << dp[n];

return 0;

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

#define eps 1e-3

#define pi acos(-1.0)

#define inf 0x3f

#define INF 0x3f3f3f3f

#define pb push_back

#define debug1 cout<<"&&";

#define debug2 cout<<"**";

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

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

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

using namespace std;

typedef double db;

typedef long long ll;

typedef unsigned long long ull;

typedef pair<int, int> pii;

typedef pair<long long, int> pli;

typedef pair<long long, long long> pll;

const int mod = 1e9 + 7;

const int N = 1e5+10;

const int M = 1e6+10;

inline int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }

inline ll Pow(ll a, ll b) { ll ans = 1; for( ; b; b >>= 1) { if(b&1) ans = ans * a % mod; a = a * a % mod;} return ans;}

inline ll Mul ( ll a, ll b)  { ll lf = a * ( b >> 25ll ) % mod * ( 1LL << 25 ) % mod; ll rg = a * ( b & ( ( 1ll << 25 ) - 1 ) ) % mod; return ( lf + rg ) % mod;}

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



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



int main() {

   scanf("%d", &n);

   ms(dp, inf); dp[n] = 0;

   for1(i, n) scanf("%d", h+i);

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

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

      else {

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

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

      }

   }

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

   return 0;

}

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

using namespace std;

typedef long long ll;

const int maxN = 2e5 + 10;



int main(){

//  freopen("abc.inp", "r", stdin); freopen("abc.out", "w", stdout);

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

  int n; cin >> n;

  vector<int> h(n+1);

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

    cin >> h[i];

  }

  int inf = 1 << 30;

  vector<int> dp(n+1, inf);

  dp[1] = 0;

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

    for (int j = i + 1; j <= n && j - i < 3; ++j) {

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

    }

  }

  cout << dp[n];

return 0;

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

using namespace std;



#define clr(arr,val) memset(arr,val ,sizeof arr)

//#define first f

//#define second s



typedef  long long ull;

typedef long long ll;

int const oo=(int)1e9 ;



int const SZ= (int)1e5+1;

//const ll mod=(ll)1e9+7;

int arr[SZ];

int dp[SZ];

int n;

//int mn=oo;

int solve(int i){

    

    if(i==n-1)

        return 0;

    if(i>=n)

        return oo;

    

    int &ret=dp[i];

    

    if(ret!=-1)

        return ret;

        

    int ch1=abs(arr[i]-arr[i+1])+solve(i+1);

    int ch2=abs(arr[i]-arr[i+2])+solve(i+2);

    ret=min(ch1,ch2);

    return ret;

    

}

int main() {

//    int t ;

//    cin>>t;

//    while(t--){

        cin>>n;

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

            cin>>arr[i];

        clr(dp,-1);

        cout<<solve(0)<<endl;

//    }

    return 0;

}

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

using namespace std;

typedef long long ll;

const int maxN = 2e5 + 10;



int main(){

//  freopen("abc.inp", "r", stdin); freopen("abc.out", "w", stdout);

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

  int n; cin >> n;

  vector<int> h(n+1);

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

    cin >> h[i];

  }

  int inf = 1 << 30;

  vector<int> dp(n+1, inf);

  dp[1] = 0;

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

    for (int j = i + 1; j <= n && j - i < 3; ++j) {

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

    }

  }

  cout << dp[n];

return 0;

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

using namespace std;

#define    sz    100110

#define    ll    long long int

ll n,c=0,p,q;

ll num[sz];

ll vis[sz];

ll dp[sz];



ll tani(int pos)

{



  if(pos>=n)return 0;

  if(vis[pos]==1)return dp[pos];

  vis[pos]=1;



  return  dp[pos]=min(abs(num[pos]-num[pos+1])+tani(pos+1),abs(num[pos]-num[pos+2])+tani(pos+2));



}



int main()

{

    ll t,i;



    for(i=1;i<sz;i++)num[i]=1000000;



    cin>>n;

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

    {

        cin>>num[i];

    }

    t=tani(1);

    cout<<t<<endl;

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 1.80029075317441x):
#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;



#define fr(i,n) _back

#define pb	push_back

#define eb	emplace_back

#define mk	make_pair

#define fi	first

#define se	second

#define endl	'\n'



typedef long long ll;

typedef pair<int,int> ii;

typedef vector<ii> vii;

const int INF = 0x3f3f3f3f;

const double PI = acos(-1.0);

const int N = 1e5 + 3;

int h[N];

int dp[N];



int main() {

    ios_base::sync_with_stdio(false);

    memset(dp, INF, sizeof dp);

    int n; cin >> n;

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



    dp[0] = 0;

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

        for(int j = max(0,i-2); j < i; j++)

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



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

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 1.4154437985455082x):
#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;



int N, a[100100], dp[100100];



int f(int n) {

	if (n==1) return 0;

	if (n==2) return abs(a[2] - a[1]);

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

	dp[n] = min(

				f(n-1) + abs(a[n] - a[n-1]),

				f(n-2) + abs(a[n] - a[n-2])

				);

	return dp[n];

}



int main() {

	cin >> N;

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

		cin >> a[i];

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

	cout << f(N) << endl;

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 1.399618076305242x):
#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;



int arr[100007];

int dp[100007];



int Solve(int idx, int n){

//	cout<<cost<<" "<<idx<<endl;

	if(idx >= n)return 1e9;

	if(idx == n - 1){

		return 0;	

	}

	

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

	

	

	return dp[idx] = min(abs(arr[idx] - arr[idx+1]) + Solve(idx+1, n), abs(arr[idx] - arr[idx+2]) + Solve(idx+2,n));

}



int main(){

	int n; cin>>n;

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

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

		

	cout<<Solve(0,n)<<endl;

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 1.40021364052304x):
#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;

int dp[100005];

int H[100005];

void memo(int i,int n)

{

	if(i==n) return;

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

	memo(i+1,n);

}

int main()

{

	int N;cin>>N;

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

	{

        cin>>H[i];

	}

	memset(dp,0,sizeof(dp));

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

	memo(2,N);

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

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 1.399508634420814x):
#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;



int dp[(int)1e5+5];

int main()

{



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







    fill(dp, dp+(int)1e5+5 , INT_MAX );



    dp[1] = 0;

    int n;

    cin>>n;

    vector <int> v(n+3,0);

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



        cin>>v[i];



    }

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



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

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



    }

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

}


// Faster C++ solution for the same problem (measured speedup: 1.4186289871610085x):
#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;



#define REP(i,a,b) for(ll i = a; i < b; i++)

#define DB( x ) cout << #x << " = " << x << endl;

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

#define endl '\n'



typedef long long ll;

typedef unsigned long long ull;

typedef pair<ll, ll> pii;

typedef pair<int, pii> tri;

typedef vector <vector <ll>> matrix;

typedef pair<string, string> pss;



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

const int MAX = (int)1e6 + 100;



const ll oo = 0x3f3f3f3f3f3f3f3f;



ll dp[MAX], a[MAX];



int main() {

    ios_base::sync_with_stdio(0);

    cin.tie(0);



    memset(dp, oo, sizeof(dp));



    int n; cin >> n;



    dp[1] = 0;



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

        cin >> a[i];

    }



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

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

        if(i - 2 >= 1){

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

        }

    }



    cout << dp[n] << endl;

}


// Faster C++ solution for the same problem (measured speedup: 9.403274647000798x):
#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:
/*|In The Name Of Allah|*/



#include <bits/stdc++.h>



using namespace std;



const int N = 1e5+5;



int n;

int h[N];

int mem[N];



int go(int idx){

    if(idx >= n)

        return 0;

    if(mem[idx] != -1)

        return mem[idx];

    int best = 1e9;

    if(idx + 1 <= n)

        best = go(idx + 1) + abs(h[idx] - h[idx + 1]);

    if(idx + 2 <= n)

        best = min(best , go(idx + 2)  + abs(h[idx] - h[idx + 2]));

    return mem[idx] = best;

}



int main(){

    scanf("%d" , &n);

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

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

    }

    memset(mem , -1 , sizeof mem);

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

}

//1 2 3


// Faster C++ solution for the same problem (measured speedup: 1.3871219493799514x):
#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 pii pair<int,int>

#define vi vector<int>

#define ppii pair<pii>



using namespace std;

const int maxn=1e5+5;



int n;

vi arr;

int dp[maxn];



int dfs(int pos)

{

    if(pos==n){return 0;}



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



    int ans=(1<<29);



    if(pos<n)

        ans=min(ans,dfs(pos+1) + abs(arr[pos]-arr[pos+1]));

    if(pos<n-1)

        ans=min(ans,dfs(pos+2) + abs(arr[pos]-arr[pos+2]));

    dp[pos]=ans;



    return ans;

}



int main()

{

    ios_base::sync_with_stdio(0);

    cin.tie(0);cout.tie(0);



    cin>>n;



    arr=vi(n+1);



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

        cin>>arr[i];



    memset(dp,-1,sizeof dp);



    cout<<dfs(1);



    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 1.4136984596714468x):
#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 <queue>

typedef long long ll;



using namespace std;



const int N=1e5+5;





int main()

{

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    cout.tie(NULL);

   int n,k=2;

   cin>>n;

   int arr[N]={},dp[N]={};

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

    cin>>arr[i];

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

   dp[0]=0;

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

   {



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

     {

         if(i-j>=0)

         {

             if(dp[i]==-1)

             {

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

             }

             else

             {

                 dp[i]=min(dp[i],dp[i-j]+abs(arr[i]-arr[i-j]));





             }





         }



     }









   }

   cout<<dp[n-1];



   return 0;

}


// Faster C++ solution for the same problem (measured speedup: 1.8610261267755257x):
#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;

#define mp make_pair

#define f first

#define s second

#define pb push_back



const int inf = 1e7;

const int N  = 1e5 + 5;



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

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



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



int solve(int idx) {



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



  int &ret = dp[idx];



  if(ret!=-1) return ret;



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



  if(idx!=n-2)

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



  return ret;



}



int main() {



    ios_base::sync_with_stdio(false);

    cin.tie(0);



    cin >> n;



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



      cin >> h[i];



    }



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



    cout << solve(0) << endl;



    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 1.4127028872317495x):
#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 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.3993994019226106x):
#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;

}