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

using namespace std;

#define ll long long



int ara[100000];

int dp[100000];



int f(int i, int n)

{

    if(i == n) return 0;

    if(dp[i] != -1)

        return dp[i];

    int cost = f(i+1,n) + abs(ara[i] - ara[i+1]);

    if(i+2<=n)

        cost = min(cost, f(i+2,n)+abs(ara[i] - ara[i+2]));

    dp[i] = cost;



    return cost;

}



int main()

{

   int n;

   cin>>n;



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

   {

       cin>>ara[i];

   }



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

   cout<<f(1,n)<<endl;



   return 0;

}






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

using namespace std;

#define ll long long

#define mod 10000007



int main()

{

    ll n;

    cin>>n;

    ll cost[n+1];

    ll dp[n+1];

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

    {

        cin>>cost[i];



    }

    dp[n]=0;

    dp[n-1]=abs(cost[n]-cost[n-1]);



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

    {

        //if(i!=(n-1))

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

    }

    //

    cout<<dp[1]<<endl;

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



#define TR 100000



int l[TR];

using namespace std;

vector<int> h;





int solve(int p) {

	if(p == 0)

		return 0;

	if(p < 0)

		return 10000000;

	if(l[p] != -1)

		return l[p];

	l[p] = min(abs(h[p] - h[p - 1]) + solve(p - 1), abs(h[p] - h[p - 2]) + solve(p - 2));

	return l[p];



}



int main() {

	int n;

	cin >> n;

	memset(l, -1, TR * sizeof(int));

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

		cin >> tmp;

		h.push_back(tmp);

	}

	solve(n - 1);

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

}

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

using namespace std;

#define ll long long

#define mod 10000007



int main()

{

    ll n;

    cin>>n;

    ll cost[n+1];

    ll dp[n+1];

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

    {

        cin>>cost[i];



    }

    dp[n]=0;

    dp[n-1]=abs(cost[n]-cost[n-1]);



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

    {

        //if(i!=(n-1))

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

    }

    //

    cout<<dp[1]<<endl;

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



using namespace std;

#define tam 100001

int dp[tam],A[tam],n,pr=0;

int solver(int index)

{

    if(dp[index] != -1)

        return dp[index];

    if(index <= 1)

        return dp[index] = abs(A[0]-A[index]);

    return dp[index] = min(solver(index-1) + abs(A[index]-A[index-1]),

    solver(index-2) + abs(A[index]-A[index-2]));

}

int main()

{

    cin>>n;

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

        cin>>A[i];

    memset(dp,-1,sizeof dp);

    dp[0] = 0; 

    cout<<solver(n-1)<<"\n";

    return 0;

}


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

using namespace std;

#define ll long long

#define mod 10000007



int main()

{

    ll n;

    cin>>n;

    ll cost[n+1];

    ll dp[n+1];

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

    {

        cin>>cost[i];



    }

    dp[n]=0;

    dp[n-1]=abs(cost[n]-cost[n-1]);



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

    {

        //if(i!=(n-1))

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

    }

    //

    cout<<dp[1]<<endl;

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

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

#define ii          pair<int,int>

#define F           first

#define S           second

#define pb          push_back

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

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

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

#define forr(i,a)   for(int i = a; i >= 0; i--)

#define fori(i,m)   for(auto i = m.begin(); i != m.end(); i++) 

#define w(t)        while(t--)

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

#define cls(a,car)  memset(a,car,sizeof (a))

#define db(x)       cerr << #x << " is " << x << '\n'

#define FL          freopen("input.txt", "r", stdin),freopen("output.txt", "w", stdout);

#define EjecuteTime cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n"

#define angle(x)    double(x * acos(-1) / 180.0)

using namespace std;

typedef long long   ll;

typedef vector<int> vi;

typedef vector<ii>  vii;

const int N = 1 * 1e5 + 5;

const ll mod = 1e9 + 7;

const double E = 1e-9;

//int dx[] = {1, 0}, dy[] = {0, 1};

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

//int dx[] = {2, 1, -1, -2, -2, -1, 1, 2}, dy[] = {1, 2, 2, 1, -1, -2, -2, -1};

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

// fflush(stdout)

// cout << flush

// a + b = a ^ b + 2 * (a & b)

int v[N];

int dp[N];

int n, k = 2;

int f(int i){

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

    int &ans = dp[i];

    if(ans == -1){

        ans = 1e9;

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

            if(i + j < n)

                ans = min(ans, f(i + j) + abs(v[i] - v[i + j]));

            else

                break;

    }

    return ans;

}

int main(){

    //FL;

    FIN;

    cin >> n;

    fore(i, 0, n)cin >> v[i];

    cls(dp, -1);

    cout << f(0) << '\n';

    

    EjecuteTime;

    return 0;

}       

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

using namespace std;

#define ll long long

#define mod 10000007



int main()

{

    ll n;

    cin>>n;

    ll cost[n+1];

    ll dp[n+1];

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

    {

        cin>>cost[i];



    }

    dp[n]=0;

    dp[n-1]=abs(cost[n]-cost[n-1]);



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

    {

        //if(i!=(n-1))

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

    }

    //

    cout<<dp[1]<<endl;

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

#define INF 0x3f3f3f3f

using namespace std;

const int maxn = 1e6+10;

int a[maxn];

int dp[maxn];

int main()

{

    int n;

    memset(dp,INF,sizeof dp);

    scanf("%d",&n);

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

    {

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

    }

    dp[1]=0;

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

    {

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

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

    }

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

    return 0;

}


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

using namespace std;

#define ll long long

#define mod 10000007



int main()

{

    ll n;

    cin>>n;

    ll cost[n+1];

    ll dp[n+1];

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

    {

        cin>>cost[i];



    }

    dp[n]=0;

    dp[n-1]=abs(cost[n]-cost[n-1]);



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

    {

        //if(i!=(n-1))

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

    }

    //

    cout<<dp[1]<<endl;

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

using namespace std;



const int mx=1e5+1;

int n,k;

int h[mx],dp[mx];

int solve(int s) //s->no of stone

{

    if(s==n) return 0;

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

    int ret=INT_MAX;

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

        if((i+s)<=n) ret=min(ret,abs(h[s+i]-h[s])+solve(s+i));

    }

    return dp[s]=ret;

}

int main()

{

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

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



    cin>>n;

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

    memset(dp,-1,sizeof dp);

    cout<<solve(1);



    return 0;

}


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

using namespace std;

#define ll long long

#define mod 10000007



int main()

{

    ll n;

    cin>>n;

    ll cost[n+1];

    ll dp[n+1];

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

    {

        cin>>cost[i];



    }

    dp[n]=0;

    dp[n-1]=abs(cost[n]-cost[n-1]);



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

    {

        //if(i!=(n-1))

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

    }

    //

    cout<<dp[1]<<endl;

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

#include<cstring>

#include<iostream>

#include<algorithm>

using namespace std;

const int maxn=100000+10;

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

int main()

{

	cin>>n;

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

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

	dp[1]=0;

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

	{

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

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

	}

	cout<<dp[n]<<endl;

	return 0;

}

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

using namespace std;

#define ll long long

#define mod 10000007



int main()

{

    ll n;

    cin>>n;

    ll cost[n+1];

    ll dp[n+1];

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

    {

        cin>>cost[i];



    }

    dp[n]=0;

    dp[n-1]=abs(cost[n]-cost[n-1]);



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

    {

        //if(i!=(n-1))

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

    }

    //

    cout<<dp[1]<<endl;

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

#define N 100007

#define inf 999999999

using namespace std;



long long mem[N];

long long ara[N];

int n;



long long dp(int i, int j)

{

    if(i >= n)

        return inf;

    if(i == j)

        return 0;

    if(mem[i] != -1)

        return mem[i];

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

    mem[i] = ans;

    return ans;

}

int main()

{

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

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

    cin >> n;

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

        cin >> ara[i];

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

    cout << dp(0, n - 1) << endl;

    return 0;

}

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

using namespace std;

#define ll long long

#define mod 10000007



int main()

{

    ll n;

    cin>>n;

    ll cost[n+1];

    ll dp[n+1];

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

    {

        cin>>cost[i];



    }

    dp[n]=0;

    dp[n-1]=abs(cost[n]-cost[n-1]);



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

    {

        //if(i!=(n-1))

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

    }

    //

    cout<<dp[1]<<endl;

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

using namespace std;

using ll = long long;

using ii = pair<int, int>;

using iii = pair<ii, int>;

#define vt vector

#define pq priority_queue

#define pb push_back

#define pf push_front

#define mp make_pair

#define fi first

#define se second

#define __lcm(a, b) a * b / __gcd(a, b)

const int MOD = 1e9 + 7;

const int INF = 2e9;

const int N = 1e5 + 5;



int n;

int a[N], dp[N];



int f(int idx) {

    if(idx > n) return INF;

    if(idx == n) return 0;

    int &sol = dp[idx];

    if(sol != -1) return sol;

    return sol = min(f(idx + 1) + abs(a[idx] - a[idx + 1]), 

                     f(idx + 2) + abs(a[idx] - a[idx + 2]));

}



void solve() {

    cin >> n;

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

        cin >> a[i];

    }

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

    cout << f(1) << "\n";

}



int main() {

 

    ios_base::sync_with_stdio(0);

    cin.tie(0); cout.tie(0);

    

    solve();

    

}

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

using namespace std;

#define ll long long

#define mod 10000007



int main()

{

    ll n;

    cin>>n;

    ll cost[n+1];

    ll dp[n+1];

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

    {

        cin>>cost[i];



    }

    dp[n]=0;

    dp[n-1]=abs(cost[n]-cost[n-1]);



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

    {

        //if(i!=(n-1))

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

    }

    //

    cout<<dp[1]<<endl;

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

#define pb emplace_back

#define ll long long

#define mp make_pair

#define PI acos(-1)

using namespace std;

ll dp[200005],a[200005],n;

ll solve(ll idx)

{

    if(idx>=n-1)

        return 0;

    if(dp[idx]!=-1)

        return dp[idx];

    ll res=INT_MAX;

    if(idx+1<n)

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

    if(idx+2<n)

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

    return dp[idx]=res;

}

int main()

{

    ios_base::sync_with_stdio(false);

    cin.tie(0);

    ll i,j,k,x,y,z,m,t,l,r;

    cin>>n;

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

        cin>>a[i];

    memset(dp,-1,sizeof dp);

    cout<<solve(0)<<'\n';

}














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

using namespace std;

#define ll long long

#define mod 10000007



int main()

{

    ll n;

    cin>>n;

    ll cost[n+1];

    ll dp[n+1];

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

    {

        cin>>cost[i];



    }

    dp[n]=0;

    dp[n-1]=abs(cost[n]-cost[n-1]);



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

    {

        //if(i!=(n-1))

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

    }

    //

    cout<<dp[1]<<endl;

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

#define fr(i,a,n) for(ll i=a;i<n;i++)

#define YES cout<<"YES"<<endl

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

#define NO cout<<"NO"<<endl

#define pb(x) emplace_back(x)

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

#define vi vector<ll>

#define mi map<ll,ll>

#define pi pair<ll,ll>

#define what(x) cout<<#x<<" ="<<x<<endl;

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

#define print(a) printf("%d",a);

using namespace std;

using ll =int;

ll n;



ll dp[200005],a[200005]={1000000000};

ll invalid=1e9;

ll cnt=0;

int solve(ll i,ll p)

{ //cnt++;

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

    if(i>=n)return 1e9;

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

    //what(p-a[i]);

    //cout<<i<<" GG "<<i+1<<endl;



    ll x=abs(a[i+1]-a[i])+solve( i+1,a[i]);



   // what(x);



    ll y=abs(a[i+2]-a[i])+solve(i+2,a[i]);

   // cout<<i<<" "<<i+2<<endl;

   //what(x); what(y);

    x=min(x,y);







    return dp[i]=x;



}



int main()

{

    ll t;

    memset(dp,-1,sizeof dp);



    scn(n);

    fr(i,0,n)cin>>a[i];



    solve(0,a[0]);



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

    //what(cnt);

    //fr(i,0,n)cout<<dp[i]<<" ";



}




















































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

using namespace std;

#define ll long long

#define mod 10000007



int main()

{

    ll n;

    cin>>n;

    ll cost[n+1];

    ll dp[n+1];

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

    {

        cin>>cost[i];



    }

    dp[n]=0;

    dp[n-1]=abs(cost[n]-cost[n-1]);



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

    {

        //if(i!=(n-1))

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

    }

    //

    cout<<dp[1]<<endl;

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

using namespace std;

int n;

long long dp[100009],ans;

long long arr[100009];

int solve(int idx)

{

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

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

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

    if(idx+2<n)

       {

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

       }

    return dp[idx]=ans;

}

int main()

{

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

    cin>>n;

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

    cout<<solve(0)<<endl;

    return 0;

}


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

using namespace std;

#define ll long long

#define mod 10000007



int main()

{

    ll n;

    cin>>n;

    ll cost[n+1];

    ll dp[n+1];

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

    {

        cin>>cost[i];



    }

    dp[n]=0;

    dp[n-1]=abs(cost[n]-cost[n-1]);



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

    {

        //if(i!=(n-1))

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

    }

    //

    cout<<dp[1]<<endl;

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



using namespace std;



#define ll long long



const int N = 1e5+4;

const ll inf = 1e16;

int h[N], n;

ll dp[3][N];



ll f(int j, int t)

{

    if(j > n)

        return inf;



    if(dp[t][j] != -1)

        return dp[t][j];



    ll x = f(j + 1, 1), y = f(j + 2, 2);



    if(x == inf and y == inf)

        x = y = 0;



    return dp[t][j] = abs(h[j] - h[j - t]) + min(x, y);

}



int main()

{

    ios_base::sync_with_stdio(0);

    cin.tie(0);

    cout.tie(0);



    cin >> n;



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

        cin >> h[i];



    memset(dp, -1, sizeof dp);



    cout << f(1, 0) << '\n';



    return 0;

}


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

using namespace std;

#define ll long long

#define mod 10000007



int main()

{

    ll n;

    cin>>n;

    ll cost[n+1];

    ll dp[n+1];

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

    {

        cin>>cost[i];



    }

    dp[n]=0;

    dp[n-1]=abs(cost[n]-cost[n-1]);



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

    {

        //if(i!=(n-1))

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

    }

    //

    cout<<dp[1]<<endl;

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

using namespace std;

#define N (int)2e5

int n,memo[N],c[N];



int dp(int curr) {

    if (curr == n) return 0;

    if (curr > n) return 1e9;

    int &sol = memo[curr];

    if (sol != -1) return sol;

    sol = min(

        dp(curr + 1) + abs(c[curr] - c[curr + 1]) ,

        dp(curr + 2) + abs(c[curr] - c[curr + 2])

    );

    return sol;

}



int main() {

    scanf("%d" , &n);

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

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

    memset (memo , -1 , sizeof memo);

    printf("%d\n" , dp(1));

}


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

using namespace std;

#define endl '\n'

#define optimize() ios_base::sync_with_stdio(0);

int n;

int arr[100001];

int cost[100001];



int func(int index)

{

    if(index>=n-1)

        return 0;

    if(cost[index]!=-1)

        return cost[index];





    if(index+1<=n-1 && index+2<=n-1)

    {

        return cost[index]=min(abs(arr[index]-arr[index+1])+func(index+1),abs(arr[index]-arr[index+2])+func(index+2));

    }



    else if(index+1<=n-1)

    {

        return cost[index]=abs(arr[index]-arr[index+1])+func(index+1);

    }





}

int main()

{

    optimize();



    cin>>n;

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

    {

        cin>>arr[i];

    }



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



    int res=func(0);

    cout<<res<<endl;

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

using namespace std;

#define ll long long int

#define dbl double

#define pi acos(-1)

#define sc1(a) scanf("%lld",&a)

#define sc2(a,b) scanf("%lld%lld",&a,&b)

#define sc3(a,b,c) scanf("%lld%lld%lld",&a,&b,&c)

#define pb push_back



ll ara[1000005];



map<ll,ll>vis;

map<ll,ll>vis1;

map<ll,ll>pos;

map<ll,ll>high;

map<ll,ll>low;

map<string,ll>mp;

vector<ll>vec;

vector<ll>v;

stack<ll>q;

string str1[100];

string str2[100];

priority_queue<ll>pq;

ll dp[1000005],t;

ll mn=1000000;

ll call(ll id)

{

    if(id==t )return 0;

    if(dp[id]!=-1)

        return dp[id];

    ll p=call(id+1)+abs(ara[id+1]-ara[id]);

    ll q=100000000;

    if(id+2!=t+1)

        q=call(id+2)+abs(ara[id+2]-ara[id]);

    dp[id]=min(p,q);

    return dp[id];



}

int main()

{



    // ll t;

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

    sc1(t);

    for(ll i=1; i<=t; i++)

    {

        sc1(ara[i]);

    }

    cout<<call(1)<<endl;

    return 0;

}


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

using namespace std;

#define endl '\n'

#define optimize() ios_base::sync_with_stdio(0);

int n;

int arr[100001];

int cost[100001];



int func(int index)

{

    if(index>=n-1)

        return 0;

    if(cost[index]!=-1)

        return cost[index];





    if(index+1<=n-1 && index+2<=n-1)

    {

        return cost[index]=min(abs(arr[index]-arr[index+1])+func(index+1),abs(arr[index]-arr[index+2])+func(index+2));

    }



    else if(index+1<=n-1)

    {

        return cost[index]=abs(arr[index]-arr[index+1])+func(index+1);

    }





}

int main()

{

    optimize();



    cin>>n;

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

    {

        cin>>arr[i];

    }



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



    int res=func(0);

    cout<<res<<endl;

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

using namespace std;



int a[1000001];

int dp[1000001];

int it;



int fr(int p){

	if (p==it-1){

      return 0;

    }

	if(dp[p]!=-1){

      return dp[p];

    }

	int re=abs(a[p]-a[p+1])+fr(p+1);

	if(p!=it-2){

      re=min(re,abs(a[p]-a[p+2])+fr(p+2));

    }

	return dp[p]=re;

}

int main(){

	cin>>it;

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

    cin>>a[i];

    }



	memset(dp,-1,sizeof dp);

	cout<<fr(0)<<endl;

	return 0;

}


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

using namespace std;

#define endl '\n'

#define optimize() ios_base::sync_with_stdio(0);

int n;

int arr[100001];

int cost[100001];



int func(int index)

{

    if(index>=n-1)

        return 0;

    if(cost[index]!=-1)

        return cost[index];





    if(index+1<=n-1 && index+2<=n-1)

    {

        return cost[index]=min(abs(arr[index]-arr[index+1])+func(index+1),abs(arr[index]-arr[index+2])+func(index+2));

    }



    else if(index+1<=n-1)

    {

        return cost[index]=abs(arr[index]-arr[index+1])+func(index+1);

    }





}

int main()

{

    optimize();



    cin>>n;

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

    {

        cin>>arr[i];

    }



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



    int res=func(0);

    cout<<res<<endl;

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

using namespace std;

typedef long long ll;

ll dp[100009];

int arr[100009];

ll sum = 0;

long long Frog1(int n){

 

    if(n==0) return 0;

    else if(n==1) return abs(arr[n] - arr[n-1]);

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

    else {

            ll x = Frog1(n-1);

            ll y = Frog1(n-2);

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

        //cout << n << " = " << dp[n] << endl;

         return dp[n];

    }

}

 

 

int main()

{

    int n;

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

    cin >> n;

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

    cout << Frog1(n-1) << endl;

}

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

using namespace std;

#define endl '\n'

#define optimize() ios_base::sync_with_stdio(0);

int n;

int arr[100001];

int cost[100001];



int func(int index)

{

    if(index>=n-1)

        return 0;

    if(cost[index]!=-1)

        return cost[index];





    if(index+1<=n-1 && index+2<=n-1)

    {

        return cost[index]=min(abs(arr[index]-arr[index+1])+func(index+1),abs(arr[index]-arr[index+2])+func(index+2));

    }



    else if(index+1<=n-1)

    {

        return cost[index]=abs(arr[index]-arr[index+1])+func(index+1);

    }





}

int main()

{

    optimize();



    cin>>n;

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

    {

        cin>>arr[i];

    }



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



    int res=func(0);

    cout<<res<<endl;

}