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

using namespace  std ;

typedef long long  ll;

typedef pair<ll, ll> Pll;

#define F first

#define S second

#define MP make_pair

#define PB push_back

#define rad(X) cout << (X) << endl

#define ASH(X) cout << (X) << " "

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

#define debug2(x,y) cout << #x << " " << x << " " << #y << " " << y << endl;

#define FOR(I,A,B) for(ll I = (A); I <= (B); I++)

#define cir(I,B,A) for(ll I = (A); I >=(B); I--)

#define MS0(X) memset((X), 0, sizeof((X)))

#define MS1(X) memset((X), -1, sizeof((X)))

#define SORT(c) (sort(c.begin(),c.end()))

#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))

#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())

#define CASES int ___T; cin >> ___T; for(int cs=1;cs<=___T;cs++)

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

template<typename T>T gcd(T x, T y){if(y==0)return x;else return gcd(y,x%y);}

ll fx[] = {1, 1, 0, -1, -1, -1, 0, 1};

ll fy[] = {0, 1, 1, 1, 0, -1, -1, -1};

//vector<ll>a,b,c;

map<ll,ll>m1,m2,m3;

ll DP[100005];



/************************************************/



void Execute()

{

      ll n, nb, k, q, a, b, c, l, r, d, x, y, p, m;

      std::cin >> n;

      ll ar[n];

      FOR(i,0,n-1) cin >> ar[i];



      DP[0] = 0;

      DP[1] = abs(ar[1] - ar[0]);



      FOR(i,2,n-1)

      {

            a = abs(ar[i] - ar[i-1]) + DP[i-1];

            b = abs(ar[i] - ar[i-2]) + DP[i-2];

        DP[i] = min(a,b);

      }

      std::cout << DP[n-1] << '\n';

}



int32_t main()

{

    //#ifndef ONLINE_JUDGE

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

    //#endif



    FAST();

    //CASES



        Execute();



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

using namespace std;

int dif(int a, int b)

{

    int ans=a-b;

    if(ans<0) ans*=-1;

    return ans;

}

int main()

{

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    int N, h[100005],i,j;

    int f1,f2;

    cin>>N;

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

        cin>>h[i];

    int M[100005]={0};

    M[N-2]=dif(h[N-1],h[N-2]);

    for(i=N-3;i>=0;i--)

    {

        f1=dif(h[i+1],h[i])+M[i+1];

        f2=dif(h[i+2],h[i])+M[i+2];

        M[i]=min(f1,f2);

    }

    cout<<M[0]<<endl;

    return 0;

}


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

using namespace std;

int main(){

    int n;

    cin >> n;

    vector<int>v(n + 3);

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

        cin >> v[i];

    }

    int dp[n + 3];

    dp[1] = 0, dp[2] = abs(v[2] - v[1]);

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

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

    }

    cout << dp[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: 5.065799957619489x):
#include<bits/stdc++.h>

using namespace std;

int main(){

    int n;

    cin >> n;

    vector<int>v(n + 3);

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

        cin >> v[i];

    }

    int dp[n + 3];

    dp[1] = 0, dp[2] = abs(v[2] - v[1]);

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

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

    }

    cout << dp[n];

    return 0;

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

using namespace std;



typedef signed long long ll;

const int MX = 1e5 + 5;

const int INF = 1e9 + 5;

int n, A[MX], dp[MX];



int solve(int pos) {

    if(pos > n) return INF;

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

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

    int ans = INF;

    if(pos + 1 < n) ans = min(ans, abs(A[pos] - A[pos + 1]) + solve(pos + 1));

    if(pos + 2 < n) ans = min(ans, abs(A[pos] - A[pos + 2]) + solve(pos + 2));

    return dp[pos] = ans;

}



int main() {

    scanf("%d", &n);



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

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

    }

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

    printf("%d\n", solve(0));

    return 0;

}

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

using namespace std;

int main(){

    int n;

    cin >> n;

    vector<int>v(n + 3);

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

        cin >> v[i];

    }

    int dp[n + 3];

    dp[1] = 0, dp[2] = abs(v[2] - v[1]);

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

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

    }

    cout << dp[n];

    return 0;

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

#include<cmath>

#include<algorithm>

#include<cstring>

using namespace std;



int h[100055],dp[100055];

const int inf = 0x3f3f3f;

int main()

{

	int n;

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

	cin>>n;

	h[1]=inf;

	h[0]=inf;

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

		cin>>h[i];

	for(int i=2;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;

} 

//max(h[i],h[i-2])-min(h[i],h[i-2])

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

using namespace std;

int main(){

    int n;

    cin >> n;

    vector<int>v(n + 3);

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

        cin >> v[i];

    }

    int dp[n + 3];

    dp[1] = 0, dp[2] = abs(v[2] - v[1]);

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

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

    }

    cout << dp[n];

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

using namespace std;

int main(){

    int n;

    cin >> n;

    vector<int>v(n + 3);

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

        cin >> v[i];

    }

    int dp[n + 3];

    dp[1] = 0, dp[2] = abs(v[2] - v[1]);

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

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

    }

    cout << dp[n];

    return 0;

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

using namespace std;

const int nax = 1e5+3;

int number;

int dyn[nax];

int a[nax];

int op1(int i){

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

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

	int res = abs(a[i]-a[i+1])+op1(i+1);

	if(i!=number-2) res = min(res, abs(a[i]-a[i+2])+op1(i+2));

	return dyn[i]=res;

}

int main(){

	cin>>number;

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

	memset(dyn, -1, sizeof dyn);

	cout<<op1(0)<<endl;

	return 0;

}


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

using namespace std;

int main(){

    int n;

    cin >> n;

    vector<int>v(n + 3);

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

        cin >> v[i];

    }

    int dp[n + 3];

    dp[1] = 0, dp[2] = abs(v[2] - v[1]);

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

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

    }

    cout << dp[n];

    return 0;

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

using namespace std;

int n, arr[100005], best, memo[100005];



int dp(int x){

	if(x==1 || x == 0){

		return 0;

	}

	if (x == 2){

		return abs(arr[x] - arr[x-1]);

	}

	if (memo[x] != -1){

		return memo[x];

	}

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

	memo[x] = best;

	return best;

}



int main(){

	ios_base::sync_with_stdio(0);

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

	cin.tie();

	cout.tie();

	cin >> n;

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

		cin >> arr[i];

	}

	cout << dp(n) << endl;

}

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

using namespace std;

int main(){

    int n;

    cin >> n;

    vector<int>v(n + 3);

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

        cin >> v[i];

    }

    int dp[n + 3];

    dp[1] = 0, dp[2] = abs(v[2] - v[1]);

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

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

    }

    cout << dp[n];

    return 0;

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

using namespace std;

int n, arr[100005], best, memo[100005];



int dp(int x){

	if(x==0 or x==1){

		return 0;

	}

	else if(x==2){

		return dp(x-1)+abs(arr[x]-arr[x-1]);

	}

	else if(memo[x]!=-1){

		return memo[x];

	}

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

	memo[x]=best;

	return best;

}



int main(){

	ios_base::sync_with_stdio(0);

	cin.tie();

	cout.tie();

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

	cin >> n;

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

		cin >> arr[i];

	}

	cout << dp(n) << endl;

}


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

using namespace std;

int main(){

    int n;

    cin >> n;

    vector<int>v(n + 3);

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

        cin >> v[i];

    }

    int dp[n + 3];

    dp[1] = 0, dp[2] = abs(v[2] - v[1]);

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

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

    }

    cout << dp[n];

    return 0;

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

using namespace std;

int arr[100010],n;

int dp[100010];

int f(int pos){

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

	int &ret=dp[pos];

	if(ret^-1)return ret;

	if(pos+1==n-1)return ret=abs(arr[pos+1]-arr[pos]);

	return ret=min(f(pos+1)+abs(arr[pos]-arr[pos+1]),f(pos+2)+abs(arr[pos]-arr[pos+2]));

}



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

{

	memset(dp,-1,sizeof dp);

	cin>>n;

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

		cout<<f(0)<<endl;

	return 0;

}

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

using namespace std;

int main(){

    int n;

    cin >> n;

    vector<int>v(n + 3);

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

        cin >> v[i];

    }

    int dp[n + 3];

    dp[1] = 0, dp[2] = abs(v[2] - v[1]);

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

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

    }

    cout << dp[n];

    return 0;

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

#define ll long long

using namespace std;

const int maxn = 1e5+5;

int a[maxn], dp[maxn];



int main(){

	int n; cin >> n;

	memset(dp, 0x3f, sizeof dp);

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

	dp[1] = 0;

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

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

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

	}

	cout << dp[n] << endl;

}

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

using namespace std;

int main(){

    int n;

    cin >> n;

    vector<int>v(n + 3);

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

        cin >> v[i];

    }

    int dp[n + 3];

    dp[1] = 0, dp[2] = abs(v[2] - v[1]);

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

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

    }

    cout << dp[n];

    return 0;

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

/*                   وتزودوا فإن خير الزاد التقوى                    */

/*       وما تدري نفس ماذا تکسب غدا وما تدري نفس باي ارض تموت      */

#include <bits/stdc++.h>

#include<unordered_map>

#include<iomanip>

#include<fstream>

using namespace std;

#include<iostream>

#define endl '\n'

#define ll long long

#define ull unsigned long long

#define dll double

#define PI acos(-1)

#define watch(x) cout<<#x<<" = { "<<x<<" }\n"

#define sz(n) n.size()

#define M_Sayed fast() 

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

#define allr(v) v.rbegin(),v.rend()

#define RT(v) return cout<<v,0

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

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

const double EPS = (1e-7);

ll Ceil(ll x, ll y) { return (x + y - 1) / y; }

void run() {

#ifndef ONLINE_JUDGE

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

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

#else

#endif

}

ll gcd(ll a, ll b) { return !b ? abs(a) : gcd(b, a % b); }

ll lcm(ll a, ll b) { return abs(a / gcd(a, b)) * b; }

ll power(ll x, ll y, ll mod) {

	if (y == 0) return 1;

	if (y == 1) return x % mod;

	ll r = power(x, y >> 1, mod);

	return (((r * r) % mod) * power(x, y & 1, mod)) % mod;

}

void fast() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); }

ll n, m, k,su,cnt;

ll vis[100009];

vector<ll>v;

ll Jum(int x) {

	if (x+1 == n)

		return 0;

	ll &ret = vis[x];

	if (~ret)return ret;

	 ret = abs(v[x] - v[x + 1])+Jum(x + 1) ;

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

		if(i+x<n)ret = min(ret,Jum(x + i) + abs(v[x] - v[x + i]));

	}

	return ret;

}

int main()

{

	//run();

	M_Sayed;

	cin >> n ;

	memset(vis, -1, sizeof vis);

	v.resize(n);

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

		cin >> v[i];

	}

	k = 2;

	RT(Jum(0));

}

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

using namespace std;

int main(){

    int n;

    cin >> n;

    vector<int>v(n + 3);

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

        cin >> v[i];

    }

    int dp[n + 3];

    dp[1] = 0, dp[2] = abs(v[2] - v[1]);

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

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

    }

    cout << dp[n];

    return 0;

}
// Slower C++ solution:
//       Author: Mostafa Mounir Shehab

 

#include <bits/stdc++.h>

using namespace std;

 

#define PI  3.14159265  // PI = acos(-1)

#define EPS (1e-10)

#define endl "\n"

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

typedef long long ll;

typedef long double ld;

//template <class Type>

 

 

void Fast(){

	std::ios_base::sync_with_stdio(0);

	cin.tie(NULL); cout.tie(NULL); cerr.tie(NULL);

}

 

inline int D(){

	int t;

	scanf("%d",&t);

	return t;

}

inline ll llD(){

	ll t;

	scanf("%lld",&t);

	return t;

}

 

 

ll MOD=1e9 + 7; 

const int N=1e5 + 5,M=50 + 1;

int arr[N];

ll dp[N];

ll OO=1e12; 

 

ll n,m,k,cnt,SU,idx,len,MN,MX;

ll l,r,mid;

ll a,b,c,d;



ll Solve(int idx){

	ll &ret = dp[idx];

	if(~ret)

		return ret;

		

	if(idx >= n)

		return ret = (idx == n) ? 0 : OO;

	

	

	ll x = abs(arr[idx] - arr[idx+1]) + Solve(idx+1);

	ll y = abs(arr[idx] - arr[idx+2]) + Solve(idx+2);

	

	return ret = min(x,y);

}







 

 

int main(){

	

	memset(dp, -1 ,sizeof dp);

	cin>>n;

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

		cin>>arr[i];



	cout<<Solve(1)<<endl;

	



	





}

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

using namespace std;

int main(){

    int n;

    cin >> n;

    vector<int>v(n + 3);

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

        cin >> v[i];

    }

    int dp[n + 3];

    dp[1] = 0, dp[2] = abs(v[2] - v[1]);

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

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

    }

    cout << dp[n];

    return 0;

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

using namespace std;

const int maxn = 1e5 + 5;

int main(){

	int a[maxn],dp[maxn],n;

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

	scanf("%d",&n);

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

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

	dp[1] = 0;

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

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

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

	}

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

	return 0;

}

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

using namespace std;

int main(){

    int n;

    cin >> n;

    vector<int>v(n + 3);

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

        cin >> v[i];

    }

    int dp[n + 3];

    dp[1] = 0, dp[2] = abs(v[2] - v[1]);

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

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

    }

    cout << dp[n];

    return 0;

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



using namespace std;



const int N = 1e5 + 9;



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



int sol(int i, int prev){

    if(i >= n)  return 1e9;

    if(i == n - 1)  return abs(h[i] - h[i - 1 - (prev == 1)]);



    int &ret = dp[i][prev];

    if(~ret)    return ret;



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

}



int main(){

    cin >> n;

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

        cin >> h[i];



    memset(dp, -1, sizeof dp);



    cout << min(sol(1, 0), sol(2, 1));



    return 0;

}

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

using namespace std;

int main(){

    int n;

    cin >> n;

    vector<int>v(n + 3);

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

        cin >> v[i];

    }

    int dp[n + 3];

    dp[1] = 0, dp[2] = abs(v[2] - v[1]);

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

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

    }

    cout << dp[n];

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

using namespace std;

int main(){

    int n;

    cin >> n;

    vector<int>v(n + 3);

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

        cin >> v[i];

    }

    int dp[n + 3];

    dp[1] = 0, dp[2] = abs(v[2] - v[1]);

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

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

    }

    cout << dp[n];

    return 0;

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

using namespace std;

int main(){

    int n;

    cin >> n;

    vector<int>v(n + 3);

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

        cin >> v[i];

    }

    int dp[n + 3];

    dp[1] = 0, dp[2] = abs(v[2] - v[1]);

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

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

    }

    cout << dp[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.4052310619172221x):
#include<bits/stdc++.h>

using namespace std;

int main(){

    int n;

    cin >> n;

    vector<int>v(n + 3);

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

        cin >> v[i];

    }

    int dp[n + 3];

    dp[1] = 0, dp[2] = abs(v[2] - v[1]);

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

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

    }

    cout << dp[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.4126197978358215x):
#include<bits/stdc++.h>

using namespace std;

int main(){

    int n;

    cin >> n;

    vector<int>v(n + 3);

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

        cin >> v[i];

    }

    int dp[n + 3];

    dp[1] = 0, dp[2] = abs(v[2] - v[1]);

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

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

    }

    cout << dp[n];

    return 0;

}