stablegradients/pie-gem5-pairs huggingface dataset:
// 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.3931219053525599x):
//Author: Fuadul Hasan(fuadul202@gmail.com)

//BSMRSTU,Gopalganj

#include<bits/stdc++.h>

using namespace std;int tc = 1;

#define happy ios::sync_with_stdio(false);

#define coding  cin.tie(0);

#define mp make_pair

#define ll long long

#define Pi atan(1)*4

#define pb  push_back

#define vpr vector<pr> 

#define pr pair<int, int> 

#define vi std::vector<int>

#define vll std::vector<ll>

#define YES printf("YES\n");

#define NO printf("NO\n");

#define Yes printf("Yes\n");

#define No printf("No\n");

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

#define point(x) setprecision(x)

#define Test printf("Case %d: ",tc++);

#define Unique(c) (c).resize(unique(all(c))-(c).begin())



const int M = 1e9 + 7;

const ll  Inf = (ll)2e18 + 5;

const int N   = 2e5 + 5;

int dp[N];

int solve() 

{

	//happy coding



	int n;

	cin>>n;

	int a[N+1];

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

		cin>>a[i];

	}



	dp[1] = 0;

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

	///cout<<dp[2]<<endl;

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

		//cout<<dp[i-1]+(abs(a[i-1]))<<" "<<dp[i-2]+(abs(a[i-2]-a[i]))<<endl;

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

		//cout<<dp[i]<<" ";

	}



	cout<<dp[n]<<endl;



	

	return 0;

}

int main(){

	int test = 1;

	//scanf("%d", &test);

	while (test--)solve();return 0;

}
// 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.3800028150121881x):
//Author: Fuadul Hasan(fuadul202@gmail.com)

//BSMRSTU,Gopalganj

#include<bits/stdc++.h>

using namespace std;int tc = 1;

#define happy ios::sync_with_stdio(false);

#define coding  cin.tie(0);

#define mp make_pair

#define ll long long

#define Pi atan(1)*4

#define pb  push_back

#define vpr vector<pr> 

#define pr pair<int, int> 

#define vi std::vector<int>

#define vll std::vector<ll>

#define YES printf("YES\n");

#define NO printf("NO\n");

#define Yes printf("Yes\n");

#define No printf("No\n");

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

#define point(x) setprecision(x)

#define Test printf("Case %d: ",tc++);

#define Unique(c) (c).resize(unique(all(c))-(c).begin())



const int M = 1e9 + 7;

const ll  Inf = (ll)2e18 + 5;

const int N   = 2e5 + 5;

int dp[N];

int solve() 

{

	//happy coding



	int n;

	cin>>n;

	int a[N+1];

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

		cin>>a[i];

	}



	dp[1] = 0;

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

	///cout<<dp[2]<<endl;

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

		//cout<<dp[i-1]+(abs(a[i-1]))<<" "<<dp[i-2]+(abs(a[i-2]-a[i]))<<endl;

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

		//cout<<dp[i]<<" ";

	}



	cout<<dp[n]<<endl;



	

	return 0;

}

int main(){

	int test = 1;

	//scanf("%d", &test);

	while (test--)solve();return 0;

}
// 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.375388533057991x):
//Author: Fuadul Hasan(fuadul202@gmail.com)

//BSMRSTU,Gopalganj

#include<bits/stdc++.h>

using namespace std;int tc = 1;

#define happy ios::sync_with_stdio(false);

#define coding  cin.tie(0);

#define mp make_pair

#define ll long long

#define Pi atan(1)*4

#define pb  push_back

#define vpr vector<pr> 

#define pr pair<int, int> 

#define vi std::vector<int>

#define vll std::vector<ll>

#define YES printf("YES\n");

#define NO printf("NO\n");

#define Yes printf("Yes\n");

#define No printf("No\n");

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

#define point(x) setprecision(x)

#define Test printf("Case %d: ",tc++);

#define Unique(c) (c).resize(unique(all(c))-(c).begin())



const int M = 1e9 + 7;

const ll  Inf = (ll)2e18 + 5;

const int N   = 2e5 + 5;

int dp[N];

int solve() 

{

	//happy coding



	int n;

	cin>>n;

	int a[N+1];

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

		cin>>a[i];

	}



	dp[1] = 0;

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

	///cout<<dp[2]<<endl;

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

		//cout<<dp[i-1]+(abs(a[i-1]))<<" "<<dp[i-2]+(abs(a[i-2]-a[i]))<<endl;

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

		//cout<<dp[i]<<" ";

	}



	cout<<dp[n]<<endl;



	

	return 0;

}

int main(){

	int test = 1;

	//scanf("%d", &test);

	while (test--)solve();return 0;

}
// 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.3921287438086336x):
//Author: Fuadul Hasan(fuadul202@gmail.com)

//BSMRSTU,Gopalganj

#include<bits/stdc++.h>

using namespace std;int tc = 1;

#define happy ios::sync_with_stdio(false);

#define coding  cin.tie(0);

#define mp make_pair

#define ll long long

#define Pi atan(1)*4

#define pb  push_back

#define vpr vector<pr> 

#define pr pair<int, int> 

#define vi std::vector<int>

#define vll std::vector<ll>

#define YES printf("YES\n");

#define NO printf("NO\n");

#define Yes printf("Yes\n");

#define No printf("No\n");

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

#define point(x) setprecision(x)

#define Test printf("Case %d: ",tc++);

#define Unique(c) (c).resize(unique(all(c))-(c).begin())



const int M = 1e9 + 7;

const ll  Inf = (ll)2e18 + 5;

const int N   = 2e5 + 5;

int dp[N];

int solve() 

{

	//happy coding



	int n;

	cin>>n;

	int a[N+1];

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

		cin>>a[i];

	}



	dp[1] = 0;

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

	///cout<<dp[2]<<endl;

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

		//cout<<dp[i-1]+(abs(a[i-1]))<<" "<<dp[i-2]+(abs(a[i-2]-a[i]))<<endl;

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

		//cout<<dp[i]<<" ";

	}



	cout<<dp[n]<<endl;



	

	return 0;

}

int main(){

	int test = 1;

	//scanf("%d", &test);

	while (test--)solve();return 0;

}
// 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.3782251969459567x):
//Author: Fuadul Hasan(fuadul202@gmail.com)

//BSMRSTU,Gopalganj

#include<bits/stdc++.h>

using namespace std;int tc = 1;

#define happy ios::sync_with_stdio(false);

#define coding  cin.tie(0);

#define mp make_pair

#define ll long long

#define Pi atan(1)*4

#define pb  push_back

#define vpr vector<pr> 

#define pr pair<int, int> 

#define vi std::vector<int>

#define vll std::vector<ll>

#define YES printf("YES\n");

#define NO printf("NO\n");

#define Yes printf("Yes\n");

#define No printf("No\n");

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

#define point(x) setprecision(x)

#define Test printf("Case %d: ",tc++);

#define Unique(c) (c).resize(unique(all(c))-(c).begin())



const int M = 1e9 + 7;

const ll  Inf = (ll)2e18 + 5;

const int N   = 2e5 + 5;

int dp[N];

int solve() 

{

	//happy coding



	int n;

	cin>>n;

	int a[N+1];

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

		cin>>a[i];

	}



	dp[1] = 0;

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

	///cout<<dp[2]<<endl;

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

		//cout<<dp[i-1]+(abs(a[i-1]))<<" "<<dp[i-2]+(abs(a[i-2]-a[i]))<<endl;

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

		//cout<<dp[i]<<" ";

	}



	cout<<dp[n]<<endl;



	

	return 0;

}

int main(){

	int test = 1;

	//scanf("%d", &test);

	while (test--)solve();return 0;

}
// 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.3941653589854366x):
//Author: Fuadul Hasan(fuadul202@gmail.com)

//BSMRSTU,Gopalganj

#include<bits/stdc++.h>

using namespace std;int tc = 1;

#define happy ios::sync_with_stdio(false);

#define coding  cin.tie(0);

#define mp make_pair

#define ll long long

#define Pi atan(1)*4

#define pb  push_back

#define vpr vector<pr> 

#define pr pair<int, int> 

#define vi std::vector<int>

#define vll std::vector<ll>

#define YES printf("YES\n");

#define NO printf("NO\n");

#define Yes printf("Yes\n");

#define No printf("No\n");

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

#define point(x) setprecision(x)

#define Test printf("Case %d: ",tc++);

#define Unique(c) (c).resize(unique(all(c))-(c).begin())



const int M = 1e9 + 7;

const ll  Inf = (ll)2e18 + 5;

const int N   = 2e5 + 5;

int dp[N];

int solve() 

{

	//happy coding



	int n;

	cin>>n;

	int a[N+1];

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

		cin>>a[i];

	}



	dp[1] = 0;

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

	///cout<<dp[2]<<endl;

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

		//cout<<dp[i-1]+(abs(a[i-1]))<<" "<<dp[i-2]+(abs(a[i-2]-a[i]))<<endl;

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

		//cout<<dp[i]<<" ";

	}



	cout<<dp[n]<<endl;



	

	return 0;

}

int main(){

	int test = 1;

	//scanf("%d", &test);

	while (test--)solve();return 0;

}
// 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.805205196262918x):
//Author: Fuadul Hasan(fuadul202@gmail.com)

//BSMRSTU,Gopalganj

#include<bits/stdc++.h>

using namespace std;int tc = 1;

#define happy ios::sync_with_stdio(false);

#define coding  cin.tie(0);

#define mp make_pair

#define ll long long

#define Pi atan(1)*4

#define pb  push_back

#define vpr vector<pr> 

#define pr pair<int, int> 

#define vi std::vector<int>

#define vll std::vector<ll>

#define YES printf("YES\n");

#define NO printf("NO\n");

#define Yes printf("Yes\n");

#define No printf("No\n");

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

#define point(x) setprecision(x)

#define Test printf("Case %d: ",tc++);

#define Unique(c) (c).resize(unique(all(c))-(c).begin())



const int M = 1e9 + 7;

const ll  Inf = (ll)2e18 + 5;

const int N   = 2e5 + 5;

int dp[N];

int solve() 

{

	//happy coding



	int n;

	cin>>n;

	int a[N+1];

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

		cin>>a[i];

	}



	dp[1] = 0;

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

	///cout<<dp[2]<<endl;

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

		//cout<<dp[i-1]+(abs(a[i-1]))<<" "<<dp[i-2]+(abs(a[i-2]-a[i]))<<endl;

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

		//cout<<dp[i]<<" ";

	}



	cout<<dp[n]<<endl;



	

	return 0;

}

int main(){

	int test = 1;

	//scanf("%d", &test);

	while (test--)solve();return 0;

}
// 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.3975661424423644x):
//Author: Fuadul Hasan(fuadul202@gmail.com)

//BSMRSTU,Gopalganj

#include<bits/stdc++.h>

using namespace std;int tc = 1;

#define happy ios::sync_with_stdio(false);

#define coding  cin.tie(0);

#define mp make_pair

#define ll long long

#define Pi atan(1)*4

#define pb  push_back

#define vpr vector<pr> 

#define pr pair<int, int> 

#define vi std::vector<int>

#define vll std::vector<ll>

#define YES printf("YES\n");

#define NO printf("NO\n");

#define Yes printf("Yes\n");

#define No printf("No\n");

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

#define point(x) setprecision(x)

#define Test printf("Case %d: ",tc++);

#define Unique(c) (c).resize(unique(all(c))-(c).begin())



const int M = 1e9 + 7;

const ll  Inf = (ll)2e18 + 5;

const int N   = 2e5 + 5;

int dp[N];

int solve() 

{

	//happy coding



	int n;

	cin>>n;

	int a[N+1];

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

		cin>>a[i];

	}



	dp[1] = 0;

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

	///cout<<dp[2]<<endl;

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

		//cout<<dp[i-1]+(abs(a[i-1]))<<" "<<dp[i-2]+(abs(a[i-2]-a[i]))<<endl;

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

		//cout<<dp[i]<<" ";

	}



	cout<<dp[n]<<endl;



	

	return 0;

}

int main(){

	int test = 1;

	//scanf("%d", &test);

	while (test--)solve();return 0;

}
// 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.3744757996773709x):
//Author: Fuadul Hasan(fuadul202@gmail.com)

//BSMRSTU,Gopalganj

#include<bits/stdc++.h>

using namespace std;int tc = 1;

#define happy ios::sync_with_stdio(false);

#define coding  cin.tie(0);

#define mp make_pair

#define ll long long

#define Pi atan(1)*4

#define pb  push_back

#define vpr vector<pr> 

#define pr pair<int, int> 

#define vi std::vector<int>

#define vll std::vector<ll>

#define YES printf("YES\n");

#define NO printf("NO\n");

#define Yes printf("Yes\n");

#define No printf("No\n");

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

#define point(x) setprecision(x)

#define Test printf("Case %d: ",tc++);

#define Unique(c) (c).resize(unique(all(c))-(c).begin())



const int M = 1e9 + 7;

const ll  Inf = (ll)2e18 + 5;

const int N   = 2e5 + 5;

int dp[N];

int solve() 

{

	//happy coding



	int n;

	cin>>n;

	int a[N+1];

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

		cin>>a[i];

	}



	dp[1] = 0;

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

	///cout<<dp[2]<<endl;

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

		//cout<<dp[i-1]+(abs(a[i-1]))<<" "<<dp[i-2]+(abs(a[i-2]-a[i]))<<endl;

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

		//cout<<dp[i]<<" ";

	}



	cout<<dp[n]<<endl;



	

	return 0;

}

int main(){

	int test = 1;

	//scanf("%d", &test);

	while (test--)solve();return 0;

}
// 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.3798815215484752x):
//Author: Fuadul Hasan(fuadul202@gmail.com)

//BSMRSTU,Gopalganj

#include<bits/stdc++.h>

using namespace std;int tc = 1;

#define happy ios::sync_with_stdio(false);

#define coding  cin.tie(0);

#define mp make_pair

#define ll long long

#define Pi atan(1)*4

#define pb  push_back

#define vpr vector<pr> 

#define pr pair<int, int> 

#define vi std::vector<int>

#define vll std::vector<ll>

#define YES printf("YES\n");

#define NO printf("NO\n");

#define Yes printf("Yes\n");

#define No printf("No\n");

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

#define point(x) setprecision(x)

#define Test printf("Case %d: ",tc++);

#define Unique(c) (c).resize(unique(all(c))-(c).begin())



const int M = 1e9 + 7;

const ll  Inf = (ll)2e18 + 5;

const int N   = 2e5 + 5;

int dp[N];

int solve() 

{

	//happy coding



	int n;

	cin>>n;

	int a[N+1];

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

		cin>>a[i];

	}



	dp[1] = 0;

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

	///cout<<dp[2]<<endl;

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

		//cout<<dp[i-1]+(abs(a[i-1]))<<" "<<dp[i-2]+(abs(a[i-2]-a[i]))<<endl;

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

		//cout<<dp[i]<<" ";

	}



	cout<<dp[n]<<endl;



	

	return 0;

}

int main(){

	int test = 1;

	//scanf("%d", &test);

	while (test--)solve();return 0;

}
// 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: 5.172481027013891x):
#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;

}