stablegradients/pie-gem5-pairs huggingface dataset:
// 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: 3.5766909758799112x):
#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;

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

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

	

using namespace std;

	

#define endl "\n"

#define ll unsigned long long

#define int long long

#define vi vector <int >

#define vii vector < pii >

#define vll vector <ll >

#define pii pair <int, int>

#define pdd pair< double, double>

#define piii pair < pii, int > 

#define pll pair<ll, ll >

#define umap unordered_map

#define pb push_back

#define pq priority_queue

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

#define rep(i,b,c) for(int i = (int)b; i < (int)c; i++)

#define a first

#define b second



int32_t main() {

	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);



	int dp[100010];

	int n;

	cin >> n;

	vi arr(n);

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

		cin >> arr[i];

	}

	dp[0] = 0;

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

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

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

	}

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



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

	

using namespace std;

	

#define endl "\n"

#define ll unsigned long long

#define int long long

#define vi vector <int >

#define vii vector < pii >

#define vll vector <ll >

#define pii pair <int, int>

#define pdd pair< double, double>

#define piii pair < pii, int > 

#define pll pair<ll, ll >

#define umap unordered_map

#define pb push_back

#define pq priority_queue

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

#define rep(i,b,c) for(int i = (int)b; i < (int)c; i++)

#define a first

#define b second



int32_t main() {

	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);



	int dp[100010];

	int n;

	cin >> n;

	vi arr(n);

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

		cin >> arr[i];

	}

	dp[0] = 0;

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

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

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

	}

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



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

	

using namespace std;

	

#define endl "\n"

#define ll unsigned long long

#define int long long

#define vi vector <int >

#define vii vector < pii >

#define vll vector <ll >

#define pii pair <int, int>

#define pdd pair< double, double>

#define piii pair < pii, int > 

#define pll pair<ll, ll >

#define umap unordered_map

#define pb push_back

#define pq priority_queue

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

#define rep(i,b,c) for(int i = (int)b; i < (int)c; i++)

#define a first

#define b second



int32_t main() {

	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);



	int dp[100010];

	int n;

	cin >> n;

	vi arr(n);

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

		cin >> arr[i];

	}

	dp[0] = 0;

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

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

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

	}

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



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

	

using namespace std;

	

#define endl "\n"

#define ll unsigned long long

#define int long long

#define vi vector <int >

#define vii vector < pii >

#define vll vector <ll >

#define pii pair <int, int>

#define pdd pair< double, double>

#define piii pair < pii, int > 

#define pll pair<ll, ll >

#define umap unordered_map

#define pb push_back

#define pq priority_queue

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

#define rep(i,b,c) for(int i = (int)b; i < (int)c; i++)

#define a first

#define b second



int32_t main() {

	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);



	int dp[100010];

	int n;

	cin >> n;

	vi arr(n);

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

		cin >> arr[i];

	}

	dp[0] = 0;

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

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

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

	}

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



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

	

using namespace std;

	

#define endl "\n"

#define ll unsigned long long

#define int long long

#define vi vector <int >

#define vii vector < pii >

#define vll vector <ll >

#define pii pair <int, int>

#define pdd pair< double, double>

#define piii pair < pii, int > 

#define pll pair<ll, ll >

#define umap unordered_map

#define pb push_back

#define pq priority_queue

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

#define rep(i,b,c) for(int i = (int)b; i < (int)c; i++)

#define a first

#define b second



int32_t main() {

	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);



	int dp[100010];

	int n;

	cin >> n;

	vi arr(n);

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

		cin >> arr[i];

	}

	dp[0] = 0;

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

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

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

	}

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



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

	

using namespace std;

	

#define endl "\n"

#define ll unsigned long long

#define int long long

#define vi vector <int >

#define vii vector < pii >

#define vll vector <ll >

#define pii pair <int, int>

#define pdd pair< double, double>

#define piii pair < pii, int > 

#define pll pair<ll, ll >

#define umap unordered_map

#define pb push_back

#define pq priority_queue

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

#define rep(i,b,c) for(int i = (int)b; i < (int)c; i++)

#define a first

#define b second



int32_t main() {

	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);



	int dp[100010];

	int n;

	cin >> n;

	vi arr(n);

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

		cin >> arr[i];

	}

	dp[0] = 0;

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

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

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

	}

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



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

	

using namespace std;

	

#define endl "\n"

#define ll unsigned long long

#define int long long

#define vi vector <int >

#define vii vector < pii >

#define vll vector <ll >

#define pii pair <int, int>

#define pdd pair< double, double>

#define piii pair < pii, int > 

#define pll pair<ll, ll >

#define umap unordered_map

#define pb push_back

#define pq priority_queue

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

#define rep(i,b,c) for(int i = (int)b; i < (int)c; i++)

#define a first

#define b second



int32_t main() {

	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);



	int dp[100010];

	int n;

	cin >> n;

	vi arr(n);

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

		cin >> arr[i];

	}

	dp[0] = 0;

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

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

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

	}

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



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

	

using namespace std;

	

#define endl "\n"

#define ll unsigned long long

#define int long long

#define vi vector <int >

#define vii vector < pii >

#define vll vector <ll >

#define pii pair <int, int>

#define pdd pair< double, double>

#define piii pair < pii, int > 

#define pll pair<ll, ll >

#define umap unordered_map

#define pb push_back

#define pq priority_queue

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

#define rep(i,b,c) for(int i = (int)b; i < (int)c; i++)

#define a first

#define b second



int32_t main() {

	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);



	int dp[100010];

	int n;

	cin >> n;

	vi arr(n);

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

		cin >> arr[i];

	}

	dp[0] = 0;

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

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

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

	}

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



	return 0;

}
// 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.419657085431561x):
    #include <iostream>

    #include <cstdio>

    #include <cstring>

    #include <algorithm>

    #include <stack>

    #include <string>

    #include <cstring>

    #include <cmath>

    #include <vector>

    #include <set>

    #define INF  0x3f3f3f3f;

    #define maxn 1000605

    typedef long long LL;

    using namespace std;

    int h[100005];

    int d[100005];

    int get_min(int a,int b){

        if(a<b)

            return a;

        else

            return b;

    }



    int main(){

        int n;

        while(cin>>n){

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

                cin>>h[i];

            d[1]=0;

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

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

                d[i]=get_min(d[i-1]+abs(h[i]-h[i-1]),d[i-2]+abs(h[i]-h[i-2]));

            }

            cout<<d[n]<<endl;

        }

        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.062742623850472x):
    #include <iostream>

    #include <cstdio>

    #include <cstring>

    #include <algorithm>

    #include <stack>

    #include <string>

    #include <cstring>

    #include <cmath>

    #include <vector>

    #include <set>

    #define INF  0x3f3f3f3f;

    #define maxn 1000605

    typedef long long LL;

    using namespace std;

    int h[100005];

    int d[100005];

    int get_min(int a,int b){

        if(a<b)

            return a;

        else

            return b;

    }



    int main(){

        int n;

        while(cin>>n){

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

                cin>>h[i];

            d[1]=0;

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

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

                d[i]=get_min(d[i-1]+abs(h[i]-h[i-1]),d[i-2]+abs(h[i]-h[i-2]));

            }

            cout<<d[n]<<endl;

        }

        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.3873016067349484x):
    #include <iostream>

    #include <cstdio>

    #include <cstring>

    #include <algorithm>

    #include <stack>

    #include <string>

    #include <cstring>

    #include <cmath>

    #include <vector>

    #include <set>

    #define INF  0x3f3f3f3f;

    #define maxn 1000605

    typedef long long LL;

    using namespace std;

    int h[100005];

    int d[100005];

    int get_min(int a,int b){

        if(a<b)

            return a;

        else

            return b;

    }



    int main(){

        int n;

        while(cin>>n){

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

                cin>>h[i];

            d[1]=0;

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

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

                d[i]=get_min(d[i-1]+abs(h[i]-h[i-1]),d[i-2]+abs(h[i]-h[i-2]));

            }

            cout<<d[n]<<endl;

        }

        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.4029014984808992x):
    #include <iostream>

    #include <cstdio>

    #include <cstring>

    #include <algorithm>

    #include <stack>

    #include <string>

    #include <cstring>

    #include <cmath>

    #include <vector>

    #include <set>

    #define INF  0x3f3f3f3f;

    #define maxn 1000605

    typedef long long LL;

    using namespace std;

    int h[100005];

    int d[100005];

    int get_min(int a,int b){

        if(a<b)

            return a;

        else

            return b;

    }



    int main(){

        int n;

        while(cin>>n){

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

                cin>>h[i];

            d[1]=0;

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

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

                d[i]=get_min(d[i-1]+abs(h[i]-h[i-1]),d[i-2]+abs(h[i]-h[i-2]));

            }

            cout<<d[n]<<endl;

        }

        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.402304326510537x):
    #include <iostream>

    #include <cstdio>

    #include <cstring>

    #include <algorithm>

    #include <stack>

    #include <string>

    #include <cstring>

    #include <cmath>

    #include <vector>

    #include <set>

    #define INF  0x3f3f3f3f;

    #define maxn 1000605

    typedef long long LL;

    using namespace std;

    int h[100005];

    int d[100005];

    int get_min(int a,int b){

        if(a<b)

            return a;

        else

            return b;

    }



    int main(){

        int n;

        while(cin>>n){

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

                cin>>h[i];

            d[1]=0;

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

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

                d[i]=get_min(d[i-1]+abs(h[i]-h[i-1]),d[i-2]+abs(h[i]-h[i-2]));

            }

            cout<<d[n]<<endl;

        }

        return 0;

    }