// 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.8203630588650106x):
/* In the name of ALLAH */

#include<bits/stdc++.h>

#include<iostream>

#include<vector>

#include<string>



// MAXIMUM and MINIMUM elements

#define mx_ari(a)   *max_element(a , a+sizeof(a)/4)

#define mn_ari(a)   *min_element(a , a+sizeof(a)/4)

#define mx_arl(a)   *max_element(a , a+sizeof(a)/8)

#define mn_arl(a)   *min_element(a , a+sizeof(a)/8)

#define mx_vec(v)   *max_element(v.begin() , v.end())

#define mn_vec(v)   *min_element(v.begin() , v.end())

// COUNT the occurence of an element

#define cnt_ari(a,b)   count(a , a+sizeof(a)/4 , b)

#define cnt_arl(a,b)   count(a , a+sizeof(a)/8 , b)

#define cnt_vec(v,b)   count(v.begin() , v.end() , b)

// INPUTs

#define sci(a)        scanf("%d",&a)

#define scii(a,b)     scanf("%d %d",&a,&b)

#define sciii(a,b,c)  scanf("%d %d %d",&a,&b,&c)

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

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

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

#define scf(a)        scanf("%f",&a)

#define scff(a,b)     scanf("%f %f",&a,&b)

#define scfff(a,b,c)  scanf("%f %f %f",&a,&b,&c)

#define scd(a)        scanf("%ld",&a)

#define scdd(a,b)     scanf("%lf %lf",&a,&b)

#define scddd(a,b,c)  scanf("%lf %lf %lf",&a,&b,&c)

// OUTPUTs

#define pri(a)        printf("%d ",a)

#define prii(a,b)     printf("%d %d ",a,b)

#define priii(a,b,c)  printf("%d %d %d ",a,b,c)

#define prl(a)        printf("%lld ",a)

#define prll(a,b)     printf("%lld %lld ",a,b)

#define prlll(a,b,c)  printf("%lld %lld %lld ",a,b,c)

#define prd(a)        printf("%.4lf ",a)

#define prdd(a,b)     printf("%.4lf %.4lf ",a,b)

#define prddd(a,b,c)  printf("%.4lf %.4lf %.4lf ",a,b,c)

#define prf(a)        printf("%.4f ",a)

#define prff(a,b)     printf("%.4f %.4f ",a,b)

#define prfff(a,b,c)  printf("%.4f %.4f %.4f ",a,b,c)

// LOOPs

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

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

#define fod(i,n)      for(double i=0;i<n;i++)

#define fof(i,n)      for(float i=0;i<n;i++)

// NEWLINEs

#define nwl           << "\n"

#define nl            printf("\n");

// PAIRs and PUSHbacks

#define mp            make_pair

#define pb            emplace_back

// IMPORTANTs

#define ll          long long

#define ull         unsigned long long int

#define mod         1000000007

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



using namespace std;











int main()

{

   int n; cin >> n;

   int a[n] , cost[n] , dp[n];

   foi(i,n){

      cin >> a[i];

   }



   cost[n-1] = 0;

   cost[n-2] = abs(a[n-1] - a[n-2]);



   for(int i=n-3; i>=0 ; i--){

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

   }



   cout << cost[0];



   return 0;

}