stablegradients/pie-gem5-pairs huggingface dataset:
// Slower C++ solution:
#pragma GCC optimize ("O3")

#include <bits/stdc++.h>

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

typedef long long ll;

using namespace std;

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

ll solve(ll i)

{

	if(i == n - 1)

		return 0;

	ll &ans = memo[i];

	if(~ans)

		return ans;

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

	if(i < n - 2)

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

	return ans;

}

int main()

{

	abdelrahman010

	cin >> n;

	memset(memo , -1 , sizeof memo);

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

		cin >> arr[i];

	cout << solve(0);

	return 0;

}


// Faster C++ solution for the same problem (measured speedup: 1.7766793400325114x):
/*BISMILLAH

THE WHITE WOLF

NO DREAM IS TOO BIG AND NO DREAMER IS TOO SMALL*/



#include<bits/stdc++.h>

using namespace std;



#define io ios_base::sync_with_stdio(false)

#define ll long long

#define ull unsigned long long

#define vi vector<int>

#define vll vector<long long>

#define pb push_back

#define mod  998244353

#define pii pair<int, int>

#define PI 2*acos(0.0)

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



int main()

{

    io;

    int n;

    cin>>n;

    vi pos(n);

    for(auto& x: pos)

        cin>>x;

    int dp[n];

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

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

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

    cout<<dp[n-1];

    return 0;

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

using namespace std;

typedef long long ll;

typedef long long int lli;

typedef long double ld;

const int oo = 1e9;

const int mod = 1e9+9;

const int nax = 1e5+3;;



int n;;

int dp[nax];

int a[nax];

int f(int i){

	if (i==n-1)

             return 0;

	if(dp[i]!=-1) 

             return dp[i];

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

	if(i!=n-2) 

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

	return dp[i]=ans;

}

int main(){



	cin>>n;



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

               cin>>a[i];;;

	memset(dp, -1, sizeof dp);



	cout<<f(0)<<endl;;

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 1.3710982914768166x):
/*BISMILLAH

THE WHITE WOLF

NO DREAM IS TOO BIG AND NO DREAMER IS TOO SMALL*/



#include<bits/stdc++.h>

using namespace std;



#define io ios_base::sync_with_stdio(false)

#define ll long long

#define ull unsigned long long

#define vi vector<int>

#define vll vector<long long>

#define pb push_back

#define mod  998244353

#define pii pair<int, int>

#define PI 2*acos(0.0)

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



int main()

{

    io;

    int n;

    cin>>n;

    vi pos(n);

    for(auto& x: pos)

        cin>>x;

    int dp[n];

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

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

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

    cout<<dp[n-1];

    return 0;

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

#include<stdio.h>

#include<cstring>

#include<cmath>

#include<algorithm>

using namespace std;

#define maxn 100005

int dp[maxn];

int h[maxn];

int n;

int main(){

    scanf("%d",&n);

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

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

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

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

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

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

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

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

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

    }

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

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 1.7522395136451976x):
/*BISMILLAH

THE WHITE WOLF

NO DREAM IS TOO BIG AND NO DREAMER IS TOO SMALL*/



#include<bits/stdc++.h>

using namespace std;



#define io ios_base::sync_with_stdio(false)

#define ll long long

#define ull unsigned long long

#define vi vector<int>

#define vll vector<long long>

#define pb push_back

#define mod  998244353

#define pii pair<int, int>

#define PI 2*acos(0.0)

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



int main()

{

    io;

    int n;

    cin>>n;

    vi pos(n);

    for(auto& x: pos)

        cin>>x;

    int dp[n];

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

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

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

    cout<<dp[n-1];

    return 0;

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



using namespace std;

int v[100010];

int memo[100010];

int c;



int f(int i)

{



    if(memo[i]!=-1)

        return memo[i];



    if(i == 0)

        return memo[0] = 0;



    if(i == 1)

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



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

}



int main()

{

    ios_base::sync_with_stdio(false);

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

    cin>>c;



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

    {

        cin>>v[i];

    }



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



    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 1.3868309979417581x):
/*BISMILLAH

THE WHITE WOLF

NO DREAM IS TOO BIG AND NO DREAMER IS TOO SMALL*/



#include<bits/stdc++.h>

using namespace std;



#define io ios_base::sync_with_stdio(false)

#define ll long long

#define ull unsigned long long

#define vi vector<int>

#define vll vector<long long>

#define pb push_back

#define mod  998244353

#define pii pair<int, int>

#define PI 2*acos(0.0)

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



int main()

{

    io;

    int n;

    cin>>n;

    vi pos(n);

    for(auto& x: pos)

        cin>>x;

    int dp[n];

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

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

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

    cout<<dp[n-1];

    return 0;

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

using namespace std;

#define Me3za() ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);srand(time(NULL))

#define endl "\n"

int n;

int arr[100005];

int mem[100005];

long long solve(int i,int cur){

if(i>=n)return 1e9;

//cout<<i<<" "<<cur<<endl;

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

long long ch1=solve(i+1,arr[i+1])+abs(cur-arr[i+1]);

long long ch2=0;

if(i+2<=n)ch2=solve(i+2,arr[i+2])+abs(cur-arr[i+2]);

return mem[i]=min(ch1,ch2);

}

int main() {

Me3za();

cin>>n;

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

    cin>>arr[i];

}

memset(mem,-1,sizeof mem);

cout<<solve(0,arr[0]);

}




// Faster C++ solution for the same problem (measured speedup: 1.3821811937394124x):
/*BISMILLAH

THE WHITE WOLF

NO DREAM IS TOO BIG AND NO DREAMER IS TOO SMALL*/



#include<bits/stdc++.h>

using namespace std;



#define io ios_base::sync_with_stdio(false)

#define ll long long

#define ull unsigned long long

#define vi vector<int>

#define vll vector<long long>

#define pb push_back

#define mod  998244353

#define pii pair<int, int>

#define PI 2*acos(0.0)

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



int main()

{

    io;

    int n;

    cin>>n;

    vi pos(n);

    for(auto& x: pos)

        cin>>x;

    int dp[n];

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

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

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

    cout<<dp[n-1];

    return 0;

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

using namespace std;



int const N=1e5+5, M=1e9+7, OO = 0x3f3f3f3f;



int n;

int arr[N];



int mem[N];

int solve(int i)

{

    if(i==n-1)

        return 0;

    if(mem[i]!=-1)

        return mem[i];

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

    int op2=(i<=n-3) ? solve(i+2)+abs(arr[i]-arr[i+2]) : OO;

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

}





int main()

{

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

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

    scanf("%d",&n);

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

        scanf("%d",arr+i);

    memset(mem, -1, sizeof mem);

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



    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 1.3588340891983641x):
/*BISMILLAH

THE WHITE WOLF

NO DREAM IS TOO BIG AND NO DREAMER IS TOO SMALL*/



#include<bits/stdc++.h>

using namespace std;



#define io ios_base::sync_with_stdio(false)

#define ll long long

#define ull unsigned long long

#define vi vector<int>

#define vll vector<long long>

#define pb push_back

#define mod  998244353

#define pii pair<int, int>

#define PI 2*acos(0.0)

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



int main()

{

    io;

    int n;

    cin>>n;

    vi pos(n);

    for(auto& x: pos)

        cin>>x;

    int dp[n];

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

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

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

    cout<<dp[n-1];

    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 == n - 1)  return 0;

    if(i == n)  return 1e9;



    int &ret = dp[i];

    if(~ret)    return ret;



    return ret = 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(0);

}

// Faster C++ solution for the same problem (measured speedup: 1.3692354092997772x):
/*BISMILLAH

THE WHITE WOLF

NO DREAM IS TOO BIG AND NO DREAMER IS TOO SMALL*/



#include<bits/stdc++.h>

using namespace std;



#define io ios_base::sync_with_stdio(false)

#define ll long long

#define ull unsigned long long

#define vi vector<int>

#define vll vector<long long>

#define pb push_back

#define mod  998244353

#define pii pair<int, int>

#define PI 2*acos(0.0)

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



int main()

{

    io;

    int n;

    cin>>n;

    vi pos(n);

    for(auto& x: pos)

        cin>>x;

    int dp[n];

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

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

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

    cout<<dp[n-1];

    return 0;

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



using namespace std;



const int N=1e5;

int n;

int arr[N];

int mem[N];



int solve(int i){

    if(i==n-1)

        return 0;

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

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

    int op2=i+2<=n-1?solve(i+2)+abs(arr[i]-arr[i+2]):1000000000;

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

}



int main() {

    scanf("%d",&n);

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

        scanf("%d",arr+i);

    memset(mem,-1,sizeof mem);

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

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 1.3584995762842558x):
/*BISMILLAH

THE WHITE WOLF

NO DREAM IS TOO BIG AND NO DREAMER IS TOO SMALL*/



#include<bits/stdc++.h>

using namespace std;



#define io ios_base::sync_with_stdio(false)

#define ll long long

#define ull unsigned long long

#define vi vector<int>

#define vll vector<long long>

#define pb push_back

#define mod  998244353

#define pii pair<int, int>

#define PI 2*acos(0.0)

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



int main()

{

    io;

    int n;

    cin>>n;

    vi pos(n);

    for(auto& x: pos)

        cin>>x;

    int dp[n];

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

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

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

    cout<<dp[n-1];

    return 0;

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

#include <bitset>

using namespace std;

#define ll long long

#define mod 1000000009



// يلعن ابو الي يعقدها على نفسه تاني



int main()

{

    ios_base::sync_with_stdio(false);    cin.tie(NULL);



    ll n; cin >> n;

    ll arr[100005];

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

        cin >> arr[i];

    }

    if(n == 2){

        cout << abs(arr[1]-arr[0]);

    }else{

        ll sol[100005] = {};

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

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

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

        }









        cout << sol[n-1];

    }















    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 1.5730097988028597x):
/*BISMILLAH

THE WHITE WOLF

NO DREAM IS TOO BIG AND NO DREAMER IS TOO SMALL*/



#include<bits/stdc++.h>

using namespace std;



#define io ios_base::sync_with_stdio(false)

#define ll long long

#define ull unsigned long long

#define vi vector<int>

#define vll vector<long long>

#define pb push_back

#define mod  998244353

#define pii pair<int, int>

#define PI 2*acos(0.0)

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



int main()

{

    io;

    int n;

    cin>>n;

    vi pos(n);

    for(auto& x: pos)

        cin>>x;

    int dp[n];

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

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

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

    cout<<dp[n-1];

    return 0;

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

 

using namespace std;

 

#define sf(n) scanf("%d", &n)

#define pd(n) printf("%.12lf", n)

#define pf(n) printf("%d", n)

#define p() printf("\n")

#define ps() printf(" ")

#define ll long long

#define ull unsigned long long

#define MAX 1e9

const int mod = 1000 * 1000 * 1000 + 7;

#define ex 1e18

#define dbl 2e09

#define qu(q) queue<int> q

#define pqu(q) priority_queue<int> q

#define len(s) s.length()

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

#define pb(x) push_back(x)

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

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

#define F first

#define S second

#define clr(x) x.clear()

#define LOG(x) std::cout << x << std::endl;

 

const int INF = 0x3f3f3f3f;

const ll LL_INF = 0x3f3f3f3f3f3f3f3f;

const double PI = 3.14159265359;

 

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

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



int a[100005];

int dp[100005];

int n;

int solve(int idx){

    if(idx==(n-1))

        return 0;

    if(idx>=n)

        return INF;

    int &ret = dp[idx];

    if(~ret)

        return ret;

    ret = INF;

    ret=min(ret,solve(idx+1)+abs(a[idx+1]-a[idx]));

    ret=min(ret,solve(idx+2)+abs(a[idx+2]-a[idx]));

    return ret;

}







int main(){



    cin>>n;

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

        cin>>a[i];

    }

    memset(dp,-1,sizeof dp);

    cout<<solve(0)<<endl;

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 1.3709113430916275x):
/*BISMILLAH

THE WHITE WOLF

NO DREAM IS TOO BIG AND NO DREAMER IS TOO SMALL*/



#include<bits/stdc++.h>

using namespace std;



#define io ios_base::sync_with_stdio(false)

#define ll long long

#define ull unsigned long long

#define vi vector<int>

#define vll vector<long long>

#define pb push_back

#define mod  998244353

#define pii pair<int, int>

#define PI 2*acos(0.0)

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



int main()

{

    io;

    int n;

    cin>>n;

    vi pos(n);

    for(auto& x: pos)

        cin>>x;

    int dp[n];

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

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

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

    cout<<dp[n-1];

    return 0;

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

using namespace std;

int abssub(int a,int b){

	if(a>b)return a-b;

	return b-a;

}

int main(){

	int n,h[100001],bp[100001]={0};

	cin>>n; 

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

		cin>>h[i];

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

		if(i==2)bp[i]=bp[i-1]+abssub(h[i],h[i-1]);

		else{

			bp[i]=min(bp[i-1]+abssub(h[i],h[i-1]),bp[i-2]+abssub(h[i],h[i-2]));

		}

	}

	cout<<bp[n]<<endl;

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 1.381878284699816x):
/*BISMILLAH

THE WHITE WOLF

NO DREAM IS TOO BIG AND NO DREAMER IS TOO SMALL*/



#include<bits/stdc++.h>

using namespace std;



#define io ios_base::sync_with_stdio(false)

#define ll long long

#define ull unsigned long long

#define vi vector<int>

#define vll vector<long long>

#define pb push_back

#define mod  998244353

#define pii pair<int, int>

#define PI 2*acos(0.0)

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



int main()

{

    io;

    int n;

    cin>>n;

    vi pos(n);

    for(auto& x: pos)

        cin>>x;

    int dp[n];

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

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

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

    cout<<dp[n-1];

    return 0;

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

#include<bits/stdc++.h>

#include<iostream>

#include<algorithm>

#include<iomanip>

#include<string>

#include<cmath>

#include<vector>

#include<set>

#include<queue>

#include<stack>

#include<fstream>

#include<map>

#include<bitset>

#include<unordered_map>

#include<cstring>

#include<cctype>

using namespace std;

#define  ll long long

#define  ull unsigned long long

#define  ul unsigned long

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

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

#define pb(s) push_back(s);

#define format(n) fixed<<setprecision(n)

#define finl "\n"

#define Mohammed_Atef_Hassan fast();

#define mod 1000000007

#define INF LLONG_MAX

#define PI acos(-1)

#define clr(dp,n) memset(dp,n,sizeof dp)

#define ex(n) return cout<<n<<finl,0;

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

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

ll fix_mod(ll x, ll y)

{

	return (y + x % y) % y;

}

void fast() {

	std::ios_base::sync_with_stdio(false);

	cin.tie(nullptr); cout.tie(nullptr);





}

int n;

vector<ll>v;

ll mem[(int)1e5 + 10];

ll solve(int i)

{

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

	ll& ret = mem[i];

	if (~ret)return ret;

	ret = solve(i + 1) + abs(v[i + 1] - v[i]);

	if (i + 2 < n)

		ret = min(ret, solve(i + 2) + abs(v[i + 2] - v[i]));

	return ret;

}

int main()

{

	Mohammed_Atef_Hassan

		clr(mem, -1);

		cin >> n;

	v = vector<ll>(n);

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

	ex(solve(0));

}

// Faster C++ solution for the same problem (measured speedup: 1.7829737634686234x):
/*BISMILLAH

THE WHITE WOLF

NO DREAM IS TOO BIG AND NO DREAMER IS TOO SMALL*/



#include<bits/stdc++.h>

using namespace std;



#define io ios_base::sync_with_stdio(false)

#define ll long long

#define ull unsigned long long

#define vi vector<int>

#define vll vector<long long>

#define pb push_back

#define mod  998244353

#define pii pair<int, int>

#define PI 2*acos(0.0)

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



int main()

{

    io;

    int n;

    cin>>n;

    vi pos(n);

    for(auto& x: pos)

        cin>>x;

    int dp[n];

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

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

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

    cout<<dp[n-1];

    return 0;

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

#include <sstream>

using namespace std;

#include <bits/stdc++.h>

#include<utility>

#include <algorithm>

#include<iterator>

#define  go return 0

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

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

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

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

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

#define F first

#define S second

#define pb push_back

#define pf push_front

#define mp make_pair

typedef long long ll;

typedef double db;

typedef vector<ll> ve;

typedef vector< vector <int> >vee;

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

typedef set<char>se;

typedef map<ll,ll> mpp;

const ll N=1e5+5;

bool f;

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

ll solve(ll i=0)

{

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

  ll &ret=dp[i];

  if(~ret)return ret;

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

}

int main()

{

ios::sync_with_stdio(0);

cin.tie(0);

   cin>>n;

   memset(dp,-1,sizeof dp);

   rep(i,n)

    cin>>arr[i];

   cout<<solve();



go;

}


// Faster C++ solution for the same problem (measured speedup: 1.7766951577506633x):
/*BISMILLAH

THE WHITE WOLF

NO DREAM IS TOO BIG AND NO DREAMER IS TOO SMALL*/



#include<bits/stdc++.h>

using namespace std;



#define io ios_base::sync_with_stdio(false)

#define ll long long

#define ull unsigned long long

#define vi vector<int>

#define vll vector<long long>

#define pb push_back

#define mod  998244353

#define pii pair<int, int>

#define PI 2*acos(0.0)

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



int main()

{

    io;

    int n;

    cin>>n;

    vi pos(n);

    for(auto& x: pos)

        cin>>x;

    int dp[n];

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

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

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

    cout<<dp[n-1];

    return 0;

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

using namespace std;



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

long long int n,ara[100005];

int f(long long int i){



    if(i==n) return 0;



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



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



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

    return dp[i];





}









int main()

{

    long long int i;

    cin>>n;

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

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

    }



    cout<<f(1)<<endl;



    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 1.7762625718278333x):
/*BISMILLAH

THE WHITE WOLF

NO DREAM IS TOO BIG AND NO DREAMER IS TOO SMALL*/



#include<bits/stdc++.h>

using namespace std;



#define io ios_base::sync_with_stdio(false)

#define ll long long

#define ull unsigned long long

#define vi vector<int>

#define vll vector<long long>

#define pb push_back

#define mod  998244353

#define pii pair<int, int>

#define PI 2*acos(0.0)

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



int main()

{

    io;

    int n;

    cin>>n;

    vi pos(n);

    for(auto& x: pos)

        cin>>x;

    int dp[n];

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

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

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

    cout<<dp[n-1];

    return 0;

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

using namespace std;

#define INF 100005

#define maxx 1000000000000



int n;

long long a[INF+5];

long long mem[INF];



long long rec(int pos)

{

    if(pos==n-1)

    {

        return 0;

    }

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

    long long tot=maxx;

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

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

    if(pos+1<n)

    {

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

    }

    if(pos+2<n)

    {

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

    }

    return mem[pos]=tot;

}



int main()

{

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

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

    scanf("%d",&n);

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

    {

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

    }

    long long ans=rec(0);

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

}


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

using namespace std;



vector<long long> altura;



long long dp[100005];

int n;

long long solve(int atual){

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

    if(atual < n-2){

        dp[atual] = min(abs(altura[atual] - altura[atual+1]) + solve(atual+1), abs(altura[atual] - altura[atual+2]) + solve(atual+2));

    }else if(atual == n-2){

        dp[atual] = abs(altura[atual] - altura[atual+1]);

    }else{

        dp[atual] = 0;

    }

    return dp[atual];

}



int main() {

    cin >> n;

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

        long long v;

        cin >> v;

        altura.push_back(v);

        dp[i] = -1;

    }

    cout << solve(0) << endl;

    return 0;

}