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

 

//#define int long long

//#pragma GCC optimize("Ofast")

//#pragma comment(linker, "/stack:200000000")

//#pragma GCC target("sse,sse2,sse3,ssse3,sse4")

 

 

#define file(s) freopen(s".in","r",stdin); freopen(s".out","w",stdout);

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

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

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

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

#define pb push_back

#define ppb pop_back

#define mp make_pair

#define s second

#define f first

 

 

using namespace std;

 

 

typedef pair < long long, long long > pll;    

typedef pair < int, int > pii;

typedef unsigned long long ull;         

typedef vector < pii > vpii;

typedef vector < int > vi;

typedef long double ldb; 

typedef long long ll;  

typedef double db;                         

 

 

const int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1}, block = 555;

const pii base = mp(1171, 3307), Mod = mp(1e9 + 7, 1e9 + 9);

const int inf = 1e9, N = 2e5 + 48, mod = 1e9 + 7;

const db eps = 1e-12, pi = 3.14159265359;

const ll INF = 1e18;





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



main () {

	cin >> n;

	forn (i, 1, n)

		cin >> h[i];	

	forn (i, 2, n)

		dp[i] = min(dp[i - 1] + abs(h[i] - h[i - 1]), i < 3 ? inf : dp[i - 2] + abs(h[i] - h[i - 2]));		



	cout << dp[n];

} 

// Faster C++ solution for the same problem (measured speedup: 5.220283836937857x):
#include <cstdio>



using namespace std;



const int maxn = 1e5+5;

int n;

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

int h[maxn],f[maxn];



int abs(int x,int y) {

	if (x - y < 0) return y - x;

	return x - y;

}



int min(int x,int y) {

	if (x < y) return x;

	return y;

}



int main() {

	scanf("%d",&n);

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

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

	}

	f[0] = f[1] = 0;

	f[2] = abs(h[1],h[2]);

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

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

	}

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

	return 0;

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

#include<cstdio>

#include<cmath>

using namespace std;

const int maxn=100010;

const int INF=0x7fffffff;

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

void init(){

	scanf("%d",&n);

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

	for(int i=2;i<=n;i++) dp[i]=INF;

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

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

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

	}

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

}

int main(){

	init();

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.202586950937642x):
#include <cstdio>



using namespace std;



const int maxn = 1e5+5;

int n;

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

int h[maxn],f[maxn];



int abs(int x,int y) {

	if (x - y < 0) return y - x;

	return x - y;

}



int min(int x,int y) {

	if (x < y) return x;

	return y;

}



int main() {

	scanf("%d",&n);

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

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

	}

	f[0] = f[1] = 0;

	f[2] = abs(h[1],h[2]);

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

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

	}

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

	return 0;

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

using namespace std;

int a[1000001],n;

int main()

{

	cin>>n;

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

	int f[100001];

	f[1]=0;

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

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

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

	cout<<f[n];

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.260158824143244x):
#include <cstdio>



using namespace std;



const int maxn = 1e5+5;

int n;

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

int h[maxn],f[maxn];



int abs(int x,int y) {

	if (x - y < 0) return y - x;

	return x - y;

}



int min(int x,int y) {

	if (x < y) return x;

	return y;

}



int main() {

	scanf("%d",&n);

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

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

	}

	f[0] = f[1] = 0;

	f[2] = abs(h[1],h[2]);

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

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

	}

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

	return 0;

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

#include<iostream>

#include<cmath>

using namespace std;

const int MAXN = 100010;

int n, a[MAXN], f[MAXN];

int main()

{

	scanf("%d",&n);

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

		scanf("%d",&a[i]),f[i]=0x3f3f3f3f;

	f[0] = f[1] = 0; a[0] = a[1];

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

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

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

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.162444167063375x):
#include <cstdio>



using namespace std;



const int maxn = 1e5+5;

int n;

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

int h[maxn],f[maxn];



int abs(int x,int y) {

	if (x - y < 0) return y - x;

	return x - y;

}



int min(int x,int y) {

	if (x < y) return x;

	return y;

}



int main() {

	scanf("%d",&n);

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

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

	}

	f[0] = f[1] = 0;

	f[2] = abs(h[1],h[2]);

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

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

	}

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

	return 0;

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

#include <algorithm>

#include <iostream>

#include <cstring>

#include <cstdlib>

#include <iomanip>

#include <vector>

#include <cstdio>

#include <stack>

#include <queue>

#include <deque>

#include <cmath>

#include <list>

#include <set>

#include <map>



using namespace std;



int a[1000010];

int f[1000010];



int main(void)

{

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

	//freopen("test.out","w",stdout);

	int n;

	cin >> n;

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

	{

		cin >> a[i];

	}

	f[1] = 0;

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

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

	{

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

		//cout << f[i] << endl;

	}

	cout  << f[n] << endl;

	return 0;

}






















// Faster C++ solution for the same problem (measured speedup: 5.228710364986844x):
#include <cstdio>



using namespace std;



const int maxn = 1e5+5;

int n;

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

int h[maxn],f[maxn];



int abs(int x,int y) {

	if (x - y < 0) return y - x;

	return x - y;

}



int min(int x,int y) {

	if (x < y) return x;

	return y;

}



int main() {

	scanf("%d",&n);

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

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

	}

	f[0] = f[1] = 0;

	f[2] = abs(h[1],h[2]);

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

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

	}

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

	return 0;

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

using namespace std;

int h[110010];

int f[11000];

int jd(int a)

{

	if(a>=0)

		return a;

	else 

		return -a;

}

int main(){

	int n;

	cin>>n;

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

	{

		cin>>h[i];

	}

	f[1]=0;

	f[2]=jd(h[2]-h[1]);

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

	{

		f[i]=min(f[i-1]+jd(h[i]-h[i-1]),f[i-2]+jd(h[i]-h[i-2]));

	}

	cout<<f[n];

	return 0;

}




// Faster C++ solution for the same problem (measured speedup: 5.220124549540789x):
#include <cstdio>



using namespace std;



const int maxn = 1e5+5;

int n;

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

int h[maxn],f[maxn];



int abs(int x,int y) {

	if (x - y < 0) return y - x;

	return x - y;

}



int min(int x,int y) {

	if (x < y) return x;

	return y;

}



int main() {

	scanf("%d",&n);

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

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

	}

	f[0] = f[1] = 0;

	f[2] = abs(h[1],h[2]);

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

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

	}

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

	return 0;

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

using namespace std;

long h[100005], f[100005];

int main()

{

	int n;

	cin >> n;

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

	{

		cin >> h[i];

	}

	f[1] = 0;

	f[2] = abs(h[1] - h[2]);

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

	{

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

	}

	cout << f[n];

	return 0;

} 

// Faster C++ solution for the same problem (measured speedup: 5.21969844873038x):
#include <cstdio>



using namespace std;



const int maxn = 1e5+5;

int n;

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

int h[maxn],f[maxn];



int abs(int x,int y) {

	if (x - y < 0) return y - x;

	return x - y;

}



int min(int x,int y) {

	if (x < y) return x;

	return y;

}



int main() {

	scanf("%d",&n);

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

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

	}

	f[0] = f[1] = 0;

	f[2] = abs(h[1],h[2]);

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

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

	}

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

	return 0;

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

#define eps 1e-3

#define pi acos(-1.0)

#define inf 0x3f3f3f3f

#define debug1 cout<<"&&";

#define debug2 cout<<"**";

#define pb push_back

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

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

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

typedef double db;

typedef long long ll;

typedef unsigned long long ull;

using namespace std;

const int mod = 1e9;

const int N = 1e5+10;

/*=======================================================================*/



int n, h[N], sum;

int f[N];



int main() {

   scanf("%d", &n);

   for1(i, n) {

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

   }

   ms(f, inf);

   f[n] = 0;

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

      if(i == 2) {

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

      } else {

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

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

      }

      // if(i == 2) {

      //    sum += abs(h[i] - h[1]);

      //    i--;

      // } else {

      //    if(abs(h[i] - h[i-1]) < abs(h[i] - h[i-2])) {

      //       sum += abs(h[i] - h[i-1]);

      //       i -= 1;

      //    } else {

      //       sum += abs(h[i] - h[i-2]);

      //       i -= 2;

      //    }

      // }

   }

   cout << f[1] << endl;

   return 0;

}

// Faster C++ solution for the same problem (measured speedup: 7.274654454857636x):
#include <cstdio>



using namespace std;



const int maxn = 1e5+5;

int n;

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

int h[maxn],f[maxn];



int abs(int x,int y) {

	if (x - y < 0) return y - x;

	return x - y;

}



int min(int x,int y) {

	if (x < y) return x;

	return y;

}



int main() {

	scanf("%d",&n);

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

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

	}

	f[0] = f[1] = 0;

	f[2] = abs(h[1],h[2]);

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

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

	}

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

	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: 7.322452135928111x):
#include <cstdio>



using namespace std;



const int maxn = 1e5+5;

int n;

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

int h[maxn],f[maxn];



int abs(int x,int y) {

	if (x - y < 0) return y - x;

	return x - y;

}



int min(int x,int y) {

	if (x < y) return x;

	return y;

}



int main() {

	scanf("%d",&n);

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

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

	}

	f[0] = f[1] = 0;

	f[2] = abs(h[1],h[2]);

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

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

	}

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

	return 0;

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

using namespace std;

int cont;

int m,n,l[100000];

int dp[1000000];

main()

{

    cin>>m;

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

        cin>>l[i];

    }

    dp[1]=0;

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

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

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

    }

   // cout<<dp[1]<<" "<<dp[3]<<" "<<dp[5]<<" ";

    cout<<dp[m];



}


// Faster C++ solution for the same problem (measured speedup: 5.221030380727922x):
#include <cstdio>



using namespace std;



const int maxn = 1e5+5;

int n;

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

int h[maxn],f[maxn];



int abs(int x,int y) {

	if (x - y < 0) return y - x;

	return x - y;

}



int min(int x,int y) {

	if (x < y) return x;

	return y;

}



int main() {

	scanf("%d",&n);

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

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

	}

	f[0] = f[1] = 0;

	f[2] = abs(h[1],h[2]);

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

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

	}

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

	return 0;

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

#include <bits/stdc++.h>



int arr[100000];

int arr2[100000];



int main()

{

	int n;

	std::cin >> n;

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

	{

		std::cin >> arr[i];

	}

	for (int i = n-2; 0 <= i; i--)

	{

		int min = INT_MAX;

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

		{

			if (i + j < n) {

				int dif = std::abs(arr[i] - arr[i + j]) + arr2[i + j];

				if (dif < min)

					min = dif;

			}

		}

		arr2[i] = min;

	}

	std::cout << arr2[0] << std::endl;

}

// Faster C++ solution for the same problem (measured speedup: 5.227741535212775x):
#include <cstdio>



using namespace std;



const int maxn = 1e5+5;

int n;

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

int h[maxn],f[maxn];



int abs(int x,int y) {

	if (x - y < 0) return y - x;

	return x - y;

}



int min(int x,int y) {

	if (x < y) return x;

	return y;

}



int main() {

	scanf("%d",&n);

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

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

	}

	f[0] = f[1] = 0;

	f[2] = abs(h[1],h[2]);

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

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

	}

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

	return 0;

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

# define ll long long

# define fi first

# define se second



using namespace std ;



ll n, x ;

ll ans[100001], vc[100001];



int main() {

    cin >> n ;

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

        cin >> vc[i] ;

    }

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

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

        if( i > 1 ) ans[i] = min(ans[i], abs(vc[i]-vc[i-2]) + ans[i-2] ) ;

    }

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

}


// Faster C++ solution for the same problem (measured speedup: 5.2247490250775535x):
#include <cstdio>



using namespace std;



const int maxn = 1e5+5;

int n;

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

int h[maxn],f[maxn];



int abs(int x,int y) {

	if (x - y < 0) return y - x;

	return x - y;

}



int min(int x,int y) {

	if (x < y) return x;

	return y;

}



int main() {

	scanf("%d",&n);

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

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

	}

	f[0] = f[1] = 0;

	f[2] = abs(h[1],h[2]);

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

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

	}

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

	return 0;

}
// Slower C++ solution:
//بِسْمِ اللَّهِ الرَّحْمَنِ الرَّحِيمِ

//لا إله إلا الله محمد رسول الله



#include <bits/stdc++.h>



#pragma GCC optimize("Ofast")



#define ll long long

#define pb push_back

#define fr first

#define sc second

#define in freopen("input.txt", "r" , stdin)

#define out freopen("snakes.out", "w", stdout)

using namespace std;



ll n;

ll h[100005];

ll dp[100005];

int main(){

    //in;

    //out;

    ios_base::sync_with_stdio(false);

    cin >> n;

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

        cin >> h[i];

    }



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

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

        if (dp[i-1] + abs (h[i] - h[i-1]) < dp[i-2] + abs (h[i] - h[i-2])) {

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

        }

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

    }



    cout << dp[n];

}






// Faster C++ solution for the same problem (measured speedup: 5.285601544430375x):
#include <cstdio>



using namespace std;



const int maxn = 1e5+5;

int n;

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

int h[maxn],f[maxn];



int abs(int x,int y) {

	if (x - y < 0) return y - x;

	return x - y;

}



int min(int x,int y) {

	if (x < y) return x;

	return y;

}



int main() {

	scanf("%d",&n);

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

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

	}

	f[0] = f[1] = 0;

	f[2] = abs(h[1],h[2]);

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

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

	}

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

	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 ppt = 1e5+3;

int n;

int dp[ppt];

int a[ppt];

int f(int i){

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

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

	int jpr = abs(a[i]-a[i+1])+f(i+1);

	if(i!=n-2) jpr = min(jpr, abs(a[i]-a[i+2])+f(i+2));

	return dp[i]=jpr;

}

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: 7.322452135928111x):
#include <cstdio>



using namespace std;



const int maxn = 1e5+5;

int n;

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

int h[maxn],f[maxn];



int abs(int x,int y) {

	if (x - y < 0) return y - x;

	return x - y;

}



int min(int x,int y) {

	if (x < y) return x;

	return y;

}



int main() {

	scanf("%d",&n);

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

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

	}

	f[0] = f[1] = 0;

	f[2] = abs(h[1],h[2]);

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

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

	}

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

	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: 7.322452135928111x):
#include <cstdio>



using namespace std;



const int maxn = 1e5+5;

int n;

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

int h[maxn],f[maxn];



int abs(int x,int y) {

	if (x - y < 0) return y - x;

	return x - y;

}



int min(int x,int y) {

	if (x < y) return x;

	return y;

}



int main() {

	scanf("%d",&n);

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

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

	}

	f[0] = f[1] = 0;

	f[2] = abs(h[1],h[2]);

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

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

	}

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

	return 0;

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



#define ll int64

#define pb push_back

#define ff first

#define ss second

#define sz size()

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

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

#define mod 1000000007

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

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

     

using namespace std;



const int maxn=110000;

int n,h[maxn],f[maxn];

int main(){

    IO;    

    scanf("%d",&n);

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

    f[1]=0,f[2]=abs(h[1]-h[2]);

    for(int i=3;i<=n;i++) f[i]=min(f[i-1]+abs(h[i]-h[i-1]),f[i-2]+abs(h[i]-h[i-2]));

    printf("%d",f[n]);    

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.273779638359456x):
#include <cstdio>



using namespace std;



const int maxn = 1e5+5;

int n;

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

int h[maxn],f[maxn];



int abs(int x,int y) {

	if (x - y < 0) return y - x;

	return x - y;

}



int min(int x,int y) {

	if (x < y) return x;

	return y;

}



int main() {

	scanf("%d",&n);

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

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

	}

	f[0] = f[1] = 0;

	f[2] = abs(h[1],h[2]);

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

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

	}

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

	return 0;

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

#define ll long long

#define ld long double

using namespace std;

const int N = 1e5+5;



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





int solve(int i)

{

    if(i == n-1)

        return 0;

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

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

    ll op2 = op1;

    if(i + 2 < n)

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

    return dp[i] = min(op1, op2);

}



int table()

{

    dp[0] = 0;

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

    {

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

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

    }

    return dp[n-1];

}



int main()

{

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

    cin >> n;

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

        cin >> h[i];

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

    cout << table();

    // cout << solve(0);





    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.293719386426632x):
#include <cstdio>



using namespace std;



const int maxn = 1e5+5;

int n;

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

int h[maxn],f[maxn];



int abs(int x,int y) {

	if (x - y < 0) return y - x;

	return x - y;

}



int min(int x,int y) {

	if (x < y) return x;

	return y;

}



int main() {

	scanf("%d",&n);

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

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

	}

	f[0] = f[1] = 0;

	f[2] = abs(h[1],h[2]);

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

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

	}

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

	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;

/*ll gcd(ll x, ll y){return (y ? gcd(y, x%y) : x); }

*ll lcm(ll x, ll y){return x*(y/gcd(x,y));}

*void exEuclid(int a, int b){

	if(b==0){x = 1; y=0; d=a; return ;}

	exEuclid(b, a%b);

	int x1=y;

	int y1=x-(a/b)*y;

	x=x1;

	y=y1;

} 

* */

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

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: 7.322328386195469x):
#include <cstdio>



using namespace std;



const int maxn = 1e5+5;

int n;

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

int h[maxn],f[maxn];



int abs(int x,int y) {

	if (x - y < 0) return y - x;

	return x - y;

}



int min(int x,int y) {

	if (x < y) return x;

	return y;

}



int main() {

	scanf("%d",&n);

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

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

	}

	f[0] = f[1] = 0;

	f[2] = abs(h[1],h[2]);

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

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

	}

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

	return 0;

}