stablegradients/pie-gem5-pairs huggingface dataset:
// Slower C++ solution:
#include <iostream>

#include <sstream>

using namespace std;

#include <bits/stdc++.h>

#include<utility>

#include <algorithm>

#include<iterator>

#define  go return 0

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

#define rep(j,m) for(int j=0;j<m;++j)

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

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

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

#define F first

#define S second

#define pb push_back

#define pf push_front

#define mp make_pair

typedef long long ll;

typedef double db;

typedef vector<ll> ve;

typedef vector< vector <int> >vee;

typedef vector<pair<int,int> >vepa;

typedef set<char>se;

typedef map<ll,ll> mpp;

const ll N=1e5+5;

bool f;

ll n,arr[N],dp[N];

ll solve(ll i=0)

{

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

  ll &ret=dp[i];

  if(~ret)return ret;

   return ret=min(solve(i+1)+abs(arr[i]-arr[i+1]) ,i+2<n? solve(i+2)+abs(arr[i]-arr[i+2]):12345 );

}

int main()

{

ios::sync_with_stdio(0);

cin.tie(0);

   cin>>n;

   memset(dp,-1,sizeof dp);

   rep(i,n)

    cin>>arr[i];

   cout<<solve();



go;

}


// Faster C++ solution for the same problem (measured speedup: 1.817621783415402x):
//A 

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int maxn = 1e5+10;

const int INF = 1e9+10;

int raw[maxn],f[maxn];

int main(){

	int n;

	cin >> n;

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

		cin >> raw[i];

		f[i] = INF;

	}

	f[1] = 0;

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

		if(i-1 > 0)f[i] = min(f[i],f[i-1] + abs(raw[i] - raw[i-1]));

		if(i-2 > 0)f[i] = min(f[i],f[i-2] + abs(raw[i] - raw[i-2]));

	}

	cout << f[n];

	return 0;

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

using namespace std;



vector<long long int> dp(100005,-1);

long long int n,ara[100005];

int f(long long int i){



    if(i==n) return 0;



    if(i==n-1) return abs(ara[i+1]-ara[i]);



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



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

    return dp[i];





}









int main()

{

    long long int i;

    cin>>n;

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

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

    }



    cout<<f(1)<<endl;



    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 1.8171792327656158x):
//A 

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int maxn = 1e5+10;

const int INF = 1e9+10;

int raw[maxn],f[maxn];

int main(){

	int n;

	cin >> n;

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

		cin >> raw[i];

		f[i] = INF;

	}

	f[1] = 0;

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

		if(i-1 > 0)f[i] = min(f[i],f[i-1] + abs(raw[i] - raw[i-1]));

		if(i-2 > 0)f[i] = min(f[i],f[i-2] + abs(raw[i] - raw[i-2]));

	}

	cout << f[n];

	return 0;

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

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

#define ii          pair<int,int>

#define F           first

#define S           second

#define pb          push_back

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

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

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

#define forr(i,a)   for(int i = a; i >= 0; i--)

#define fori(i,m)   for(auto i = m.begin(); i != m.end(); i++) 

#define w(t)        while(t--)

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

#define cls(a,car)  memset(a,car,sizeof (a))

#define db(x)       cerr << #x << " is " << x << '\n'

#define FL          freopen("in", "r", stdin),freopen("out", "w", stdout);

#define EjecuteTime cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n"

#define angle(x)    double(x * acos(-1) / 180.0)

using namespace std;

typedef long long   ll;

typedef vector<int> vi;

typedef vector<ii>  vii;

const int N = 1 * 1e5 + 5;

const ll mod = 1e9 + 7;

const double E = 1e-9;

//int dx[] = {1, 0}, dy[] = {0, 1};

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

//int dx[] = {2, 1, -1, -2, -2, -1, 1, 2}, dy[] = {1, 2, 2, 1, -1, -2, -2, -1};

// fflush(stdout)

// cout << flush

// a + b = a ^ b + 2 * (a & b)

int n, k;

int v[N];

int dp[N];

int f(int i){

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

    int &ans = dp[i];

    if(ans != -1)return ans;

    ans = 1e9;

    for(int j = 1; j <= 2; j++){

        if(i + j < n)

            ans = min(ans, f(i + j) + abs(v[i] - v[i + j]));

    }

    return ans;

}

int main(){

    //FL;

    FIN;

    cin >> n;

    fore(i, 0, n)cin >> v[i];

    cls(dp, -1);

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

    EjecuteTime;

    return 0;

}       

// Faster C++ solution for the same problem (measured speedup: 1.4424820198864943x):
//A 

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int maxn = 1e5+10;

const int INF = 1e9+10;

int raw[maxn],f[maxn];

int main(){

	int n;

	cin >> n;

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

		cin >> raw[i];

		f[i] = INF;

	}

	f[1] = 0;

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

		if(i-1 > 0)f[i] = min(f[i],f[i-1] + abs(raw[i] - raw[i-1]));

		if(i-2 > 0)f[i] = min(f[i],f[i-2] + abs(raw[i] - raw[i-2]));

	}

	cout << f[n];

	return 0;

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



#define clr(x) memset((x), 0, sizeof(x))

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

#define pb push_back

#define mp make_pair

#define For(i, st, en) for(int i=(st); i<=(int)(en); i++)

#define Ford(i, st, en) for(int i=(st); i>=(int)(en); i--)

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

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

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

#define fori(it, x) for (__typeof((x).begin()) it = (x).begin(); it != (x).end(); it++)

#define in(x) int (x); input((x));

#define x first

#define y second

#define less(a,b) ((a) < (b) - EPS)

#define more(a,b) ((a) > (b) + EPS)

#define eq(a,b) (fabs((a) - (b)) < EPS)

#define remax(a, b) ((a) = (b) > (a) ? (b) : (a))

#define remin(a, b) ((a) = (b) < (a) ? (b) : (a))

#define salfinal(x) cout<<x<<endl;

using namespace std;

const int MAX =1e5+1;

int v[MAX];

int memo[MAX];

int c;



int f(int i)

{



    if(memo[i]!=-1)

        return memo[i];



    if(i == 0)

        return memo[0] = 0;



    if(i == 1)

        return memo[1] = abs(v[0] - v[1]);



    return memo[i] = min(abs(v[i] - v[i-1]) + f(i-1), abs(v[i] - v[i-2]) + f(i-2));

}



int main()

{

    ios_base::sync_with_stdio(false);

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

    cin>>c;



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

    {

        cin>>v[i];

    }



    cout<<f(c-1)<<endl;



    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 1.4186870386054569x):
//A 

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int maxn = 1e5+10;

const int INF = 1e9+10;

int raw[maxn],f[maxn];

int main(){

	int n;

	cin >> n;

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

		cin >> raw[i];

		f[i] = INF;

	}

	f[1] = 0;

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

		if(i-1 > 0)f[i] = min(f[i],f[i-1] + abs(raw[i] - raw[i-1]));

		if(i-2 > 0)f[i] = min(f[i],f[i-2] + abs(raw[i] - raw[i-2]));

	}

	cout << f[n];

	return 0;

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





using namespace std;

int n;

vector<int> vec;



int meme[100007];



int solve(int index){



    if(index==n-1){

        return 0;

    }

    if(meme[index]!=-1){

        return meme[index];

    }

    

    int ret1 = 100000000;

    int ret2 = 100000000;

    if(index+1<n){

         ret1 = abs (vec[index]- vec[index+1]) + solve(index+1); 

    }

    if(index+2<n){

         ret2 = abs (vec[index]- vec[index+2]) + solve(index+2); 

    }





    return meme[index] = min(ret1,ret2);

}



int main(){

    cin>>n;

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

    int num;

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

        cin>>num;

        vec.push_back(num);

    }

    cout<<solve(0)<<endl;

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 1.4053901556255761x):
//A 

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int maxn = 1e5+10;

const int INF = 1e9+10;

int raw[maxn],f[maxn];

int main(){

	int n;

	cin >> n;

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

		cin >> raw[i];

		f[i] = INF;

	}

	f[1] = 0;

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

		if(i-1 > 0)f[i] = min(f[i],f[i-1] + abs(raw[i] - raw[i-1]));

		if(i-2 > 0)f[i] = min(f[i],f[i-2] + abs(raw[i] - raw[i-2]));

	}

	cout << f[n];

	return 0;

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

#define ll long long

using namespace std;

#define inf 0x3f3f3f3f 

int main(){

	ll t , h[100001] , dp[100001] = {0};

    cin >> t;

	for(int i = 0 ; i < t ; ++i) scanf("%lld",h+i);

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

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

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

        cout<<dp[t-1];

}

// Faster C++ solution for the same problem (measured speedup: 1.8284365032540302x):
//A 

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int maxn = 1e5+10;

const int INF = 1e9+10;

int raw[maxn],f[maxn];

int main(){

	int n;

	cin >> n;

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

		cin >> raw[i];

		f[i] = INF;

	}

	f[1] = 0;

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

		if(i-1 > 0)f[i] = min(f[i],f[i-1] + abs(raw[i] - raw[i-1]));

		if(i-2 > 0)f[i] = min(f[i],f[i-2] + abs(raw[i] - raw[i-2]));

	}

	cout << f[n];

	return 0;

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

using namespace std;

#define INF 100005

#define maxx 1000000000000



int n;

long long a[INF+5];

long long mem[INF];



long long rec(int pos)

{

    if(pos==n-1)

    {

        return 0;

    }

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

    long long tot=maxx;

    long long left=abs(a[pos]-a[pos+1]);

    long long right=abs(a[pos]-a[pos+2]);

    if(pos+1<n)

    {

        tot=min(tot,left+rec(pos+1));

    }

    if(pos+2<n)

    {

        tot=min(tot,right+rec(pos+2));

    }

    return mem[pos]=tot;

}



int main()

{

    memset(a,0,sizeof(a));

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

    scanf("%d",&n);

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

    {

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

    }

    long long ans=rec(0);

    printf("%lld\n",ans);

}


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

using namespace std;

int mod = 1000000007;

int main() {

	// your code goes here

	cin.tie(NULL);

	cout.tie(NULL);

	int n;

	while(cin>>n){

	vector<int>cost(n);

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

	vector<unsigned long long>dp(n);

	dp[0]=0;

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

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

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

	

	

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

	}

	return 0;

}
// Slower C++ solution:
// Created by ahmed_drawy on 10/09/19.

///dp educational contest atcoder - vjudge

#include <bits/stdc++.h>

#include <string.h>

#pragma clang diagnostic push

#pragma ide diagnostic ignored "OCUnusedMacroInspection"

using namespace std;

#define lp(i,start , end)       for(int i = start ; i<end ; ++i)

#define lllp(i,start , end)       for(ll i = start ; i<end ; ++i)

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

#define Rlp(i,start , end)      for(int i = start ; i>end ; --i)

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

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

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

#define inf 0x3f3f3f3f

//#define dbg (v)    for(auto it : v)cout<<it<<' ';

typedef long long               ll;

typedef vector<int>             vi;

typedef vector  <ll>            vll;

typedef vector<vector<int> >    adj;

typedef pair<int ,int>          pii;

const double EPS =1e-7;

const int OO = 1e6;

#define endl '\n'

#define cint(c) (int)c -'0';

#define itc(c) (char)c +'A';

bool sortpair( const pair<int , int> & x, const pair<int , int> & y){

    return  x.first != y.first ? x.first < y.first : x.second > y.second ;

}

int dcomp(double x , double y){

    return fabs(x-y) <= EPS? 0: x>y?1:-1;

}



void smile() {

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

#ifndef ONLINE_JUDGE

//    freopen("/home/tw3/Desktop/Desktop/training/in.txt", "r", stdin);

//    freopen("/home/tw3/Desktop/Desktop/training/out.txt" , "w" , stdout);

#endif

}

#define fastin smile()



int n ;

const int N = 1e5 +3;

ll dp[N];

int h[N];

//ll solve(int indx , int state){

//    if(indx == n-1 )return 0 ;

//    ll &ret = dp[indx  ] [ state];

//    if(~ret )

//        return ret;

//    ret=  INT_MAX;

//    for (int i = 1; i <=2 && i+indx < n ; ++i) {

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

//    }

//    return ret ;

//}

int main() {

    fastin;

    cin >> n;

    inN(h,  n );

    clr(dp , 0);

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

        if(j>=2){

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

        }

        else if(j ==1){

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

        }

    }

    cout << dp[n-1];

//

//    clr(dp , -1);

//    cout << solve(0, 1)<<endl;

}

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

using namespace std;

int mod = 1000000007;

int main() {

	// your code goes here

	cin.tie(NULL);

	cout.tie(NULL);

	int n;

	while(cin>>n){

	vector<int>cost(n);

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

	vector<unsigned long long>dp(n);

	dp[0]=0;

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

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

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

	

	

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

	}

	return 0;

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

using namespace std;

typedef long long int ll;

const int MAX=1e5+10;

int N,A[MAX],dp[MAX];

int solve(int idx)

{

    if(idx==N)return 0;

    if(idx>N)return 1e9;

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

    return dp[idx]=min(abs(A[idx+1]-A[idx])+solve(idx+1),abs(A[idx+2]-A[idx])+solve(idx+2));

}

int  main ()

{

    memset(dp,-1,sizeof dp);

    cin >> N;

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

        cin >> A[i];

    }

    cout<<solve(1)<<endl;

    return 0;

}


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

using namespace std;

int mod = 1000000007;

int main() {

	// your code goes here

	cin.tie(NULL);

	cout.tie(NULL);

	int n;

	while(cin>>n){

	vector<int>cost(n);

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

	vector<unsigned long long>dp(n);

	dp[0]=0;

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

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

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

	

	

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

	}

	return 0;

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

using namespace std;



#define mp make_pair

#define pb push_back

#define st first

#define nd second

#define lb lower_bound

#define ub upper_bound



typedef long long ll;

typedef long double ld;

typedef pair<int,int> pi;

typedef pair<ll,ll> pll;

typedef vector<int> vi;

typedef vector<ll> vll;

typedef vector<pi> vpi;

typedef vector<pll> vpll;



const ll oo=1e18;

const int MOD=1000000007;

const int INF=1000000000;

const ld EPS=0.000000001;



int dp[100005],h[100005],n,k=2;



signed main() {

    ios_base::sync_with_stdio(NULL);

    cin.tie(NULL);

    cout.tie(NULL);

    memset(dp,0x3f3f,sizeof dp);

    dp[1]=0;

    h[0]=0;

    cin>>n;

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

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

        for(int j=1;j<=min(k,i);++j) {

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

        }

    }

    cout<<dp[n];

    return 0;

}


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

using namespace std;

int mod = 1000000007;

int main() {

	// your code goes here

	cin.tie(NULL);

	cout.tie(NULL);

	int n;

	while(cin>>n){

	vector<int>cost(n);

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

	vector<unsigned long long>dp(n);

	dp[0]=0;

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

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

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

	

	

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

	}

	return 0;

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

#include<iostream>

#include<cmath>

#include<stack>

#include<cstring>

#include<algorithm>

using namespace std;

int n;

int h[100005];

int dp[100005];



int main()

{

memset(dp, 0x3f ,sizeof dp);

scanf("%d",&n);

for( int i = 1 ; i <= n ; i++) scanf("%d",&h[i]);

dp[1] = 0;

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

{

	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",dp[n]);



	return 0;

}






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

using namespace std;

int mod = 1000000007;

int main() {

	// your code goes here

	cin.tie(NULL);

	cout.tie(NULL);

	int n;

	while(cin>>n){

	vector<int>cost(n);

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

	vector<unsigned long long>dp(n);

	dp[0]=0;

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

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

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

	

	

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

	}

	return 0;

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

#include<cstdio>

#include<string>

#include<cstring>

#include<algorithm>

#include<queue>

#include<stack>

#include<map>

#include<vector>

#include<set>

#include<list>

#define ll long long

using namespace std;

ll h[200050],dp[200050];

int main()

{

	ll n;

	cin>>n;

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

		cin>>h[i];

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

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

using namespace std;

int mod = 1000000007;

int main() {

	// your code goes here

	cin.tie(NULL);

	cout.tie(NULL);

	int n;

	while(cin>>n){

	vector<int>cost(n);

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

	vector<unsigned long long>dp(n);

	dp[0]=0;

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

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

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

	

	

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

	}

	return 0;

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



using namespace std;

const int maxn = 2e5+2;

const int mod = 1e9+7;

const int inf = 1e9;



typedef long long ll;



int n;

int arr[maxn], dp[maxn];



int solve_dp (int pos){

    if (pos > n) return inf;

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



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



    int ans = inf;

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

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



    return dp[pos] = ans;

}



int main(){



    ios_base::sync_with_stdio(0);

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



    cin >> n;



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

        cin >> arr[i];

    }



    memset(dp, -1, sizeof dp);



    cout << solve_dp(0) << "\n";



    return 0;

}


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

using namespace std;

int mod = 1000000007;

int main() {

	// your code goes here

	cin.tie(NULL);

	cout.tie(NULL);

	int n;

	while(cin>>n){

	vector<int>cost(n);

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

	vector<unsigned long long>dp(n);

	dp[0]=0;

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

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

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

	

	

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

	}

	return 0;

}
// Slower C++ solution:
#pragma GCC optimize ("O3")

#include <bits/stdc++.h>

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

typedef long long ll;

using namespace std;

ll n , arr[100005] , memo[100005];

ll solve(ll i)

{

	if(i == n - 1)

		return 0;

	ll &ans = memo[i];

	if(~ans)

		return ans;

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

	if(i < n - 2)

		ans = min(ans , abs(arr[i] - arr[i + 2]) + solve(i + 2));

	return ans;

}

int main()

{

	abdelrahman010

	cin >> n;

	memset(memo , -1 , sizeof memo);

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

		cin >> arr[i];

	cout << solve(0);

	return 0;

}


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

using namespace std;

int mod = 1000000007;

int main() {

	// your code goes here

	cin.tie(NULL);

	cout.tie(NULL);

	int n;

	while(cin>>n){

	vector<int>cost(n);

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

	vector<unsigned long long>dp(n);

	dp[0]=0;

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

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

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

	

	

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

	}

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

using namespace std;

int mod = 1000000007;

int main() {

	// your code goes here

	cin.tie(NULL);

	cout.tie(NULL);

	int n;

	while(cin>>n){

	vector<int>cost(n);

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

	vector<unsigned long long>dp(n);

	dp[0]=0;

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

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

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

	

	

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

	}

	return 0;

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

#include<stdio.h>

#include<cstring>

#include<cmath>

#include<algorithm>

using namespace std;

#define maxn 100005

int dp[maxn];

int h[maxn];

int n;

int main(){

    scanf("%d",&n);

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

    memset(h,0,sizeof(h));

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

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

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

        if(i-1>=1&&i-2>=1)

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

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

        else if(i-2>=1) dp[i] = dp[i-2]+abs(h[i]-h[i-2]);

    }

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

    return 0;

}


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

using namespace std;

int mod = 1000000007;

int main() {

	// your code goes here

	cin.tie(NULL);

	cout.tie(NULL);

	int n;

	while(cin>>n){

	vector<int>cost(n);

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

	vector<unsigned long long>dp(n);

	dp[0]=0;

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

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

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

	

	

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

	}

	return 0;

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



using namespace std;

int v[100010];

int memo[100010];

int c;



int f(int i)

{



    if(memo[i]!=-1)

        return memo[i];



    if(i == 0)

        return memo[0] = 0;



    if(i == 1)

        return memo[1] = abs(v[0] - v[1]);



    return memo[i] = min(abs(v[i] - v[i-1]) + f(i-1), abs(v[i] - v[i-2]) + f(i-2));

}



int main()

{

    ios_base::sync_with_stdio(false);

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

    cin>>c;



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

    {

        cin>>v[i];

    }



    cout<<f(c-1)<<endl;



    return 0;

}

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

using namespace std;

int mod = 1000000007;

int main() {

	// your code goes here

	cin.tie(NULL);

	cout.tie(NULL);

	int n;

	while(cin>>n){

	vector<int>cost(n);

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

	vector<unsigned long long>dp(n);

	dp[0]=0;

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

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

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

	

	

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

	}

	return 0;

}