import java.io.*; 
import java.util.*; 
//import javafx.util.*; 
import java.math.*;
//import java.lang.*;
 class Main 
{ 
  //  static int n;static ArrayList<Integer> arr[];
   // int ans[];
   
    public static void main(String[] args) throws IOException { 
    //    Scanner sc=new Scanner(System.in);
        PrintWriter pw = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
        br = new BufferedReader(new InputStreamReader(System.in));
        int n=nextInt();
        int h[]=new int[n];
        for(int i=0;i<n;i++){
            h[i]=nextInt();
        }
        int dp[]=new int[n];
        for(int i=0;i<n;i++){
            dp[i]=-1;
        }
        int ans=find(dp,0,h,n);
        pw.println(ans);
        pw.close();
    }
    static int find(int dp[],int i,int h[],int n){
        if(i==n-1){
            return 0;
        }
        if(dp[i]!=-1){
            return dp[i];
        }
        if(i==n-2){
            if(dp[i+1]!=-1){
                return dp[i]=dp[i+1]+Math.abs(h[i+1]-h[i]);
            }
            return dp[i]=find(dp,i+1,h,n)+Math.abs(h[i+1]-h[i]);
        }
        if(dp[i+1]!=-1){
            return dp[i]=Math.min(dp[i+1]+Math.abs(h[i+1]-h[i]),find(dp,i+2,h,n)+Math.abs(h[i+2]-h[i]));
        }
        else if(dp[i+2]!=-1){
            return dp[i]=Math.min(find(dp,i+1,h,n)+Math.abs(h[i+1]-h[i]),dp[i+2]+Math.abs(h[i+2]-h[i]));
        }
        else if(dp[i+1]!=-1&&dp[i+2]!=-1){
            return dp[i]=Math.min(dp[i+1]+Math.abs(h[i+1]-h[i]),dp[i+2]+Math.abs(h[i+2]-h[i]));
        }
        return dp[i]=Math.min(find(dp,i+1,h,n)+Math.abs(h[i+1]-h[i]),find(dp,i+2,h,n)+Math.abs(h[i+2]-h[i]));
    }

    
    public static BufferedReader br;
    public static StringTokenizer st;
    public static String next() {
        while (st == null || !st.hasMoreTokens()) {
            try {
                st = new StringTokenizer(br.readLine());
            } catch (Exception e) {
                throw new RuntimeException(e);
            }
        }
        return st.nextToken();
    }
 
    public static Integer nextInt() {
        return Integer.parseInt(next());
    }
 
    public static Long nextLong() {
        return Long.parseLong(next());
    }
 
    public static Double nextDouble() {
        return Double.parseDouble(next());
    }
    static class Pair{
        int x;int y;int z;
        Pair(int x,int y,int z){
            this.x=x;
            this.y=y;
            this.z=z;
          //  this.i=i;
        }
    }
    static class sorting implements Comparator<Pair>{
        public int compare(Pair a,Pair b){
            //return (a.y)-(b.y);
            return (a.x-b.x);
        }
    }
    public static int[] na(int n)throws IOException{
        int[] a = new int[n];
        for(int i = 0;i < n;i++)a[i] = nextInt();
        return a;
    }
    static class query implements Comparable<query>{
        int l,r,idx,block;
        static int len;
        query(int l,int r,int i){
            this.l=l;
            this.r=r;
            this.idx=i;
            this.block=l/len;
        }   
        public int compareTo(query a){
            return block==a.block?r-a.r:block-a.block;
        }
    }
    static boolean isPrime(int n) { 
        if (n <= 1) 
            return false; 
        if (n <= 3) 
            return true; 
        if (n % 2 == 0 ||  
            n % 3 == 0) 
            return false; 
      
        for (int i = 5; 
                 i * i <= n; i = i + 6) 
            if (n % i == 0 || 
                n % (i + 2) == 0) 
                return false; 
      
        return true; 
    } 
    static long gcd(long a, long b) { 
      if (b == 0) 
        return a; 
      return gcd(b, a % b);  
    }  
    static long modInverse(long a, long m) { 
        long g = gcd(a, m); 
        if (g != 1) 
            return -1; 
        else{ 
            // If a and m are relatively prime, then modulo inverse 
            // is a^(m-2) mode m 
            return (power(a, m - 2, m)); 
        } 
    } 
      
    // To compute x^y under modulo m 
    static long power(long x, long y, long m){ 
        if (y == 0) 
            return 1;      
        long p = power(x, y / 2, m) % m; 
        p = (p * p) % m; 
      
        if (y % 2 == 0) 
            return p; 
        else
            return (x * p) % m; 
    }
    static long fast_pow(long base,long n,long M){
        if(n==0)
           return 1;
        if(n==1)
        return base;
        long halfn=fast_pow(base,n/2,M);
        if(n%2==0)
            return ( halfn * halfn ) % M;
        else
            return ( ( ( halfn * halfn ) % M ) * base ) % M;
    }
       static long modInverse(long n,int M){
        return fast_pow(n,M-2,M);
    }
    
} 

Measured memory_bytes: 54856