import java.io.*; 
import java.util.*;

class Compare implements Comparator<Pair>{
    public int compare(Pair a, Pair b){
        return a.y - b.y;
    }
}

class Pair{
    String x;
    int y;

    Pair(String a, int b){
        x = a;
        y = b;
    }
}

public class Main {

    public static int solute(int []arr, int i){
        if(i==0){
            return 0;
        }
        int a = 0 , b = 0;
        if(i >= 2){
            a = Math.abs(arr[i]-arr[i-1]) + solute(arr,i-1);
            b = Math.abs(arr[i]-arr[i-2]) + solute(arr,i-2);
            return Math.min(a,b);
        }else if(i==1){
            return Math.abs(arr[i] - arr[i-1]);
        }
        return -1 ;
    }

    public static int soluteTopBottom(int []arr, int i, int []ans){
        if(i == 0 ){
            ans[0] = 0 ;
            return 0;
        }
        int a = 0 , b = 0;
        if(i >= 2){
            if(ans[i-1]!=-1){
                a = Math.abs(arr[i]-arr[i-1]) + ans[i-1];
            }else{
                a = Math.abs(arr[i]-arr[i-1]) + soluteTopBottom(arr,i-1,ans);
            }

            if(ans[i-2]!=-1){
                b = Math.abs(arr[i]-arr[i-2]) + ans[i-2];
            }else{
                b = Math.abs(arr[i]-arr[i-2]) + soluteTopBottom(arr,i-2,ans);
            }

            return Math.min(a,b);
        }else if(i==1){
            ans[i] = Math.abs(arr[i] - arr[i-1]);
            return ans[i];
        }
        return -1;
    }
    public static int soluteBottomUp(int []arr, int j, int []ans){
        Arrays.fill(ans , 0);
        int a = 0 , b = 0;
        if(arr.length > 1)
            ans[1] = Math.abs(arr[1] - arr[0]);
        for(int i =2 ; i < arr.length ; i++){
            a = Math.abs(arr[i] - arr[i-1])+ans[i-1];
            b = Math.abs(arr[i] - arr[i-2])+ans[i-2];
            ans[i] = Math.min(a,b);
        }   
        return ans[arr.length - 1];
    }

    public static void main(String []args) throws Exception{
        Reader obj = new Reader();
        int n = obj.nextInt();
        int []arr = new int[n];

        for(int i = 0 ; i < n ; i++){
            arr[i] = obj.nextInt();
        }

        int []ans = new int[n];
        Arrays.fill(ans, -1);
        //System.out.println(solute(arr,n-1));
        //System.out.println(soluteTopBottom(arr,n-1,ans));
        System.out.println(soluteBottomUp(arr,n-1,ans));
    }

    static class Reader 
    { 
        final private int BUFFER_SIZE = 1 << 16; 
        private DataInputStream din; 
        private byte[] buffer; 
        private int bufferPointer, bytesRead; 
  
        public Reader() 
        { 
            din = new DataInputStream(System.in); 
            buffer = new byte[BUFFER_SIZE]; 
            bufferPointer = bytesRead = 0; 
        } 
  
        public Reader(String file_name) throws IOException 
        { 
            din = new DataInputStream(new FileInputStream(file_name)); 
            buffer = new byte[BUFFER_SIZE]; 
            bufferPointer = bytesRead = 0; 
        } 
  
        public String readLine() throws IOException 
        { 
            byte[] buf = new byte[64]; // line length 
            int cnt = 0, c; 
            while ((c = read()) != -1) 
            { 
                if (c == '\n') 
                    break; 
                buf[cnt++] = (byte) c; 
            } 
            return new String(buf, 0, cnt); 
        } 
  
        public int nextInt() throws IOException 
        { 
            int ret = 0; 
            byte c = read(); 
            while (c <= ' ') 
                c = read(); 
            boolean neg = (c == '-'); 
            if (neg) 
                c = read(); 
            do
            { 
                ret = ret * 10 + c - '0'; 
            }  while ((c = read()) >= '0' && c <= '9'); 
  
            if (neg) 
                return -ret; 
            return ret; 
        } 
  
        public long nextLong() throws IOException 
        { 
            long ret = 0; 
            byte c = read(); 
            while (c <= ' ') 
                c = read(); 
            boolean neg = (c == '-'); 
            if (neg) 
                c = read(); 
            do { 
                ret = ret * 10 + c - '0'; 
            } 
            while ((c = read()) >= '0' && c <= '9'); 
            if (neg) 
                return -ret; 
            return ret; 
        } 
  
        public double nextDouble() throws IOException 
        { 
            double ret = 0, div = 1; 
            byte c = read(); 
            while (c <= ' ') 
                c = read(); 
            boolean neg = (c == '-'); 
            if (neg) 
                c = read(); 
  
            do { 
                ret = ret * 10 + c - '0'; 
            } 
            while ((c = read()) >= '0' && c <= '9'); 
  
            if (c == '.') 
            { 
                while ((c = read()) >= '0' && c <= '9') 
                { 
                    ret += (c - '0') / (div *= 10); 
                } 
            } 
  
            if (neg) 
                return -ret; 
            return ret; 
        } 
  
        private void fillBuffer() throws IOException 
        { 
            bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE); 
            if (bytesRead == -1) 
                buffer[0] = -1; 
        } 
  
        private byte read() throws IOException 
        { 
            if (bufferPointer == bytesRead) 
                fillBuffer(); 
            return buffer[bufferPointer++]; 
        } 
  
        public void close() throws IOException 
        { 
            if (din == null) 
                return; 
            din.close(); 
        } 
    } 
    


}  import java.io.*; io.* java import java.util.*; util.* java class Compare implements Comparator<Pair>{
    public int compare(Pair a, Pair b){
        return a.y - b.y;
    }
} Compare public int compare(Pair a, Pair b){
        return a.y - b.y;
    } compare {
        return a.y - b.y;
    } return a.y - b.y; a.y - b.y a.y a a.y b.y b b.y Pair a a Pair b b Comparator class Pair{
    String x;
    int y;

    Pair(String a, int b){
        x = a;
        y = b;
    }
} Pair String x; x int y; y Pair(String a, int b){
        x = a;
        y = b;
    } Pair {
        x = a;
        y = b;
    } x = a x a y = b y b String a a int b b public class Main {

    public static int solute(int []arr, int i){
        if(i==0){
            return 0;
        }
        int a = 0 , b = 0;
        if(i >= 2){
            a = Math.abs(arr[i]-arr[i-1]) + solute(arr,i-1);
            b = Math.abs(arr[i]-arr[i-2]) + solute(arr,i-2);
            return Math.min(a,b);
        }else if(i==1){
            return Math.abs(arr[i] - arr[i-1]);
        }
        return -1 ;
    }

    public static int soluteTopBottom(int []arr, int i, int []ans){
        if(i == 0 ){
            ans[0] = 0 ;
            return 0;
        }
        int a = 0 , b = 0;
        if(i >= 2){
            if(ans[i-1]!=-1){
                a = Math.abs(arr[i]-arr[i-1]) + ans[i-1];
            }else{
                a = Math.abs(arr[i]-arr[i-1]) + soluteTopBottom(arr,i-1,ans);
            }

            if(ans[i-2]!=-1){
                b = Math.abs(arr[i]-arr[i-2]) + ans[i-2];
            }else{
                b = Math.abs(arr[i]-arr[i-2]) + soluteTopBottom(arr,i-2,ans);
            }

            return Math.min(a,b);
        }else if(i==1){
            ans[i] = Math.abs(arr[i] - arr[i-1]);
            return ans[i];
        }
        return -1;
    }
    public static int soluteBottomUp(int []arr, int j, int []ans){
        Arrays.fill(ans , 0);
        int a = 0 , b = 0;
        if(arr.length > 1)
            ans[1] = Math.abs(arr[1] - arr[0]);
        for(int i =2 ; i < arr.length ; i++){
            a = Math.abs(arr[i] - arr[i-1])+ans[i-1];
            b = Math.abs(arr[i] - arr[i-2])+ans[i-2];
            ans[i] = Math.min(a,b);
        }   
        return ans[arr.length - 1];
    }

    public static void main(String []args) throws Exception{
        Reader obj = new Reader();
        int n = obj.nextInt();
        int []arr = new int[n];

        for(int i = 0 ; i < n ; i++){
            arr[i] = obj.nextInt();
        }

        int []ans = new int[n];
        Arrays.fill(ans, -1);
        //System.out.println(solute(arr,n-1));
        //System.out.println(soluteTopBottom(arr,n-1,ans));
        System.out.println(soluteBottomUp(arr,n-1,ans));
    }

    static class Reader 
    { 
        final private int BUFFER_SIZE = 1 << 16; 
        private DataInputStream din; 
        private byte[] buffer; 
        private int bufferPointer, bytesRead; 
  
        public Reader() 
        { 
            din = new DataInputStream(System.in); 
            buffer = new byte[BUFFER_SIZE]; 
            bufferPointer = bytesRead = 0; 
        } 
  
        public Reader(String file_name) throws IOException 
        { 
            din = new DataInputStream(new FileInputStream(file_name)); 
            buffer = new byte[BUFFER_SIZE]; 
            bufferPointer = bytesRead = 0; 
        } 
  
        public String readLine() throws IOException 
        { 
            byte[] buf = new byte[64]; // line length 
            int cnt = 0, c; 
            while ((c = read()) != -1) 
            { 
                if (c == '\n') 
                    break; 
                buf[cnt++] = (byte) c; 
            } 
            return new String(buf, 0, cnt); 
        } 
  
        public int nextInt() throws IOException 
        { 
            int ret = 0; 
            byte c = read(); 
            while (c <= ' ') 
                c = read(); 
            boolean neg = (c == '-'); 
            if (neg) 
                c = read(); 
            do
            { 
                ret = ret * 10 + c - '0'; 
            }  while ((c = read()) >= '0' && c <= '9'); 
  
            if (neg) 
                return -ret; 
            return ret; 
        } 
  
        public long nextLong() throws IOException 
        { 
            long ret = 0; 
            byte c = read(); 
            while (c <= ' ') 
                c = read(); 
            boolean neg = (c == '-'); 
            if (neg) 
                c = read(); 
            do { 
                ret = ret * 10 + c - '0'; 
            } 
            while ((c = read()) >= '0' && c <= '9'); 
            if (neg) 
                return -ret; 
            return ret; 
        } 
  
        public double nextDouble() throws IOException 
        { 
            double ret = 0, div = 1; 
            byte c = read(); 
            while (c <= ' ') 
                c = read(); 
            boolean neg = (c == '-'); 
            if (neg) 
                c = read(); 
  
            do { 
                ret = ret * 10 + c - '0'; 
            } 
            while ((c = read()) >= '0' && c <= '9'); 
  
            if (c == '.') 
            { 
                while ((c = read()) >= '0' && c <= '9') 
                { 
                    ret += (c - '0') / (div *= 10); 
                } 
            } 
  
            if (neg) 
                return -ret; 
            return ret; 
        } 
  
        private void fillBuffer() throws IOException 
        { 
            bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE); 
            if (bytesRead == -1) 
                buffer[0] = -1; 
        } 
  
        private byte read() throws IOException 
        { 
            if (bufferPointer == bytesRead) 
                fillBuffer(); 
            return buffer[bufferPointer++]; 
        } 
  
        public void close() throws IOException 
        { 
            if (din == null) 
                return; 
            din.close(); 
        } 
    } 
    


} Main public static int solute(int []arr, int i){
        if(i==0){
            return 0;
        }
        int a = 0 , b = 0;
        if(i >= 2){
            a = Math.abs(arr[i]-arr[i-1]) + solute(arr,i-1);
            b = Math.abs(arr[i]-arr[i-2]) + solute(arr,i-2);
            return Math.min(a,b);
        }else if(i==1){
            return Math.abs(arr[i] - arr[i-1]);
        }
        return -1 ;
    } solute {
        if(i==0){
            return 0;
        }
        int a = 0 , b = 0;
        if(i >= 2){
            a = Math.abs(arr[i]-arr[i-1]) + solute(arr,i-1);
            b = Math.abs(arr[i]-arr[i-2]) + solute(arr,i-2);
            return Math.min(a,b);
        }else if(i==1){
            return Math.abs(arr[i] - arr[i-1]);
        }
        return -1 ;
    } if(i==0){
            return 0;
        } i==0 i 0 {
            return 0;
        } return 0; 0 int a = 0 a 0 b = 0; b 0 if(i >= 2){
            a = Math.abs(arr[i]-arr[i-1]) + solute(arr,i-1);
            b = Math.abs(arr[i]-arr[i-2]) + solute(arr,i-2);
            return Math.min(a,b);
        }else if(i==1){
            return Math.abs(arr[i] - arr[i-1]);
        } i >= 2 i 2 {
            a = Math.abs(arr[i]-arr[i-1]) + solute(arr,i-1);
            b = Math.abs(arr[i]-arr[i-2]) + solute(arr,i-2);
            return Math.min(a,b);
        } a = Math.abs(arr[i]-arr[i-1]) + solute(arr,i-1) a Math.abs(arr[i]-arr[i-1]) + solute(arr,i-1) Math.abs(arr[i]-arr[i-1]) Math.abs Math arr[i]-arr[i-1] arr[i] arr i arr[i-1] arr i-1 i 1 solute(arr,i-1) solute arr i-1 i 1 b = Math.abs(arr[i]-arr[i-2]) + solute(arr,i-2) b Math.abs(arr[i]-arr[i-2]) + solute(arr,i-2) Math.abs(arr[i]-arr[i-2]) Math.abs Math arr[i]-arr[i-2] arr[i] arr i arr[i-2] arr i-2 i 2 solute(arr,i-2) solute arr i-2 i 2 return Math.min(a,b); Math.min(a,b) Math.min Math a b if(i==1){
            return Math.abs(arr[i] - arr[i-1]);
        } i==1 i 1 {
            return Math.abs(arr[i] - arr[i-1]);
        } return Math.abs(arr[i] - arr[i-1]); Math.abs(arr[i] - arr[i-1]) Math.abs Math arr[i] - arr[i-1] arr[i] arr i arr[i-1] arr i-1 i 1 return -1 ; -1 1 int []arr arr int i i public static int soluteTopBottom(int []arr, int i, int []ans){
        if(i == 0 ){
            ans[0] = 0 ;
            return 0;
        }
        int a = 0 , b = 0;
        if(i >= 2){
            if(ans[i-1]!=-1){
                a = Math.abs(arr[i]-arr[i-1]) + ans[i-1];
            }else{
                a = Math.abs(arr[i]-arr[i-1]) + soluteTopBottom(arr,i-1,ans);
            }

            if(ans[i-2]!=-1){
                b = Math.abs(arr[i]-arr[i-2]) + ans[i-2];
            }else{
                b = Math.abs(arr[i]-arr[i-2]) + soluteTopBottom(arr,i-2,ans);
            }

            return Math.min(a,b);
        }else if(i==1){
            ans[i] = Math.abs(arr[i] - arr[i-1]);
            return ans[i];
        }
        return -1;
    } soluteTopBottom {
        if(i == 0 ){
            ans[0] = 0 ;
            return 0;
        }
        int a = 0 , b = 0;
        if(i >= 2){
            if(ans[i-1]!=-1){
                a = Math.abs(arr[i]-arr[i-1]) + ans[i-1];
            }else{
                a = Math.abs(arr[i]-arr[i-1]) + soluteTopBottom(arr,i-1,ans);
            }

            if(ans[i-2]!=-1){
                b = Math.abs(arr[i]-arr[i-2]) + ans[i-2];
            }else{
                b = Math.abs(arr[i]-arr[i-2]) + soluteTopBottom(arr,i-2,ans);
            }

            return Math.min(a,b);
        }else if(i==1){
            ans[i] = Math.abs(arr[i] - arr[i-1]);
            return ans[i];
        }
        return -1;
    } if(i == 0 ){
            ans[0] = 0 ;
            return 0;
        } i == 0 i 0 {
            ans[0] = 0 ;
            return 0;
        } ans[0] = 0 ans[0] ans 0 0 return 0; 0 int a = 0 a 0 b = 0; b 0 if(i >= 2){
            if(ans[i-1]!=-1){
                a = Math.abs(arr[i]-arr[i-1]) + ans[i-1];
            }else{
                a = Math.abs(arr[i]-arr[i-1]) + soluteTopBottom(arr,i-1,ans);
            }

            if(ans[i-2]!=-1){
                b = Math.abs(arr[i]-arr[i-2]) + ans[i-2];
            }else{
                b = Math.abs(arr[i]-arr[i-2]) + soluteTopBottom(arr,i-2,ans);
            }

            return Math.min(a,b);
        }else if(i==1){
            ans[i] = Math.abs(arr[i] - arr[i-1]);
            return ans[i];
        } i >= 2 i 2 {
            if(ans[i-1]!=-1){
                a = Math.abs(arr[i]-arr[i-1]) + ans[i-1];
            }else{
                a = Math.abs(arr[i]-arr[i-1]) + soluteTopBottom(arr,i-1,ans);
            }

            if(ans[i-2]!=-1){
                b = Math.abs(arr[i]-arr[i-2]) + ans[i-2];
            }else{
                b = Math.abs(arr[i]-arr[i-2]) + soluteTopBottom(arr,i-2,ans);
            }

            return Math.min(a,b);
        } if(ans[i-1]!=-1){
                a = Math.abs(arr[i]-arr[i-1]) + ans[i-1];
            }else{
                a = Math.abs(arr[i]-arr[i-1]) + soluteTopBottom(arr,i-1,ans);
            } ans[i-1]!=-1 ans[i-1] ans i-1 i 1 -1 1 {
                a = Math.abs(arr[i]-arr[i-1]) + ans[i-1];
            } a = Math.abs(arr[i]-arr[i-1]) + ans[i-1] a Math.abs(arr[i]-arr[i-1]) + ans[i-1] Math.abs(arr[i]-arr[i-1]) Math.abs Math arr[i]-arr[i-1] arr[i] arr i arr[i-1] arr i-1 i 1 ans[i-1] ans i-1 i 1 {
                a = Math.abs(arr[i]-arr[i-1]) + soluteTopBottom(arr,i-1,ans);
            } a = Math.abs(arr[i]-arr[i-1]) + soluteTopBottom(arr,i-1,ans) a Math.abs(arr[i]-arr[i-1]) + soluteTopBottom(arr,i-1,ans) Math.abs(arr[i]-arr[i-1]) Math.abs Math arr[i]-arr[i-1] arr[i] arr i arr[i-1] arr i-1 i 1 soluteTopBottom(arr,i-1,ans) soluteTopBottom arr i-1 i 1 ans if(ans[i-2]!=-1){
                b = Math.abs(arr[i]-arr[i-2]) + ans[i-2];
            }else{
                b = Math.abs(arr[i]-arr[i-2]) + soluteTopBottom(arr,i-2,ans);
            } ans[i-2]!=-1 ans[i-2] ans i-2 i 2 -1 1 {
                b = Math.abs(arr[i]-arr[i-2]) + ans[i-2];
            } b = Math.abs(arr[i]-arr[i-2]) + ans[i-2] b Math.abs(arr[i]-arr[i-2]) + ans[i-2] Math.abs(arr[i]-arr[i-2]) Math.abs Math arr[i]-arr[i-2] arr[i] arr i arr[i-2] arr i-2 i 2 ans[i-2] ans i-2 i 2 {
                b = Math.abs(arr[i]-arr[i-2]) + soluteTopBottom(arr,i-2,ans);
            } b = Math.abs(arr[i]-arr[i-2]) + soluteTopBottom(arr,i-2,ans) b Math.abs(arr[i]-arr[i-2]) + soluteTopBottom(arr,i-2,ans) Math.abs(arr[i]-arr[i-2]) Math.abs Math arr[i]-arr[i-2] arr[i] arr i arr[i-2] arr i-2 i 2 soluteTopBottom(arr,i-2,ans) soluteTopBottom arr i-2 i 2 ans return Math.min(a,b); Math.min(a,b) Math.min Math a b if(i==1){
            ans[i] = Math.abs(arr[i] - arr[i-1]);
            return ans[i];
        } i==1 i 1 {
            ans[i] = Math.abs(arr[i] - arr[i-1]);
            return ans[i];
        } ans[i] = Math.abs(arr[i] - arr[i-1]) ans[i] ans i Math.abs(arr[i] - arr[i-1]) Math.abs Math arr[i] - arr[i-1] arr[i] arr i arr[i-1] arr i-1 i 1 return ans[i]; ans[i] ans i return -1; -1 1 int []arr arr int i i int []ans ans public static int soluteBottomUp(int []arr, int j, int []ans){
        Arrays.fill(ans , 0);
        int a = 0 , b = 0;
        if(arr.length > 1)
            ans[1] = Math.abs(arr[1] - arr[0]);
        for(int i =2 ; i < arr.length ; i++){
            a = Math.abs(arr[i] - arr[i-1])+ans[i-1];
            b = Math.abs(arr[i] - arr[i-2])+ans[i-2];
            ans[i] = Math.min(a,b);
        }   
        return ans[arr.length - 1];
    } soluteBottomUp {
        Arrays.fill(ans , 0);
        int a = 0 , b = 0;
        if(arr.length > 1)
            ans[1] = Math.abs(arr[1] - arr[0]);
        for(int i =2 ; i < arr.length ; i++){
            a = Math.abs(arr[i] - arr[i-1])+ans[i-1];
            b = Math.abs(arr[i] - arr[i-2])+ans[i-2];
            ans[i] = Math.min(a,b);
        }   
        return ans[arr.length - 1];
    } Arrays.fill(ans , 0) Arrays.fill Arrays ans 0 int a = 0 a 0 b = 0; b 0 if(arr.length > 1)
            ans[1] = Math.abs(arr[1] - arr[0]); arr.length > 1 arr.length arr arr.length 1 ans[1] = Math.abs(arr[1] - arr[0]) ans[1] ans 1 Math.abs(arr[1] - arr[0]) Math.abs Math arr[1] - arr[0] arr[1] arr 1 arr[0] arr 0 for(int i =2 ; i < arr.length ; i++){
            a = Math.abs(arr[i] - arr[i-1])+ans[i-1];
            b = Math.abs(arr[i] - arr[i-2])+ans[i-2];
            ans[i] = Math.min(a,b);
        } int i =2 ; int i =2 ; i 2 i < arr.length i arr.length arr arr.length i++ i++ i {
            a = Math.abs(arr[i] - arr[i-1])+ans[i-1];
            b = Math.abs(arr[i] - arr[i-2])+ans[i-2];
            ans[i] = Math.min(a,b);
        } {
            a = Math.abs(arr[i] - arr[i-1])+ans[i-1];
            b = Math.abs(arr[i] - arr[i-2])+ans[i-2];
            ans[i] = Math.min(a,b);
        } a = Math.abs(arr[i] - arr[i-1])+ans[i-1] a Math.abs(arr[i] - arr[i-1])+ans[i-1] Math.abs(arr[i] - arr[i-1]) Math.abs Math arr[i] - arr[i-1] arr[i] arr i arr[i-1] arr i-1 i 1 ans[i-1] ans i-1 i 1 b = Math.abs(arr[i] - arr[i-2])+ans[i-2] b Math.abs(arr[i] - arr[i-2])+ans[i-2] Math.abs(arr[i] - arr[i-2]) Math.abs Math arr[i] - arr[i-2] arr[i] arr i arr[i-2] arr i-2 i 2 ans[i-2] ans i-2 i 2 ans[i] = Math.min(a,b) ans[i] ans i Math.min(a,b) Math.min Math a b return ans[arr.length - 1]; ans[arr.length - 1] ans arr.length - 1 arr.length arr arr.length 1 int []arr arr int j j int []ans ans public static void main(String []args) throws Exception{
        Reader obj = new Reader();
        int n = obj.nextInt();
        int []arr = new int[n];

        for(int i = 0 ; i < n ; i++){
            arr[i] = obj.nextInt();
        }

        int []ans = new int[n];
        Arrays.fill(ans, -1);
        //System.out.println(solute(arr,n-1));
        //System.out.println(soluteTopBottom(arr,n-1,ans));
        System.out.println(soluteBottomUp(arr,n-1,ans));
    } main {
        Reader obj = new Reader();
        int n = obj.nextInt();
        int []arr = new int[n];

        for(int i = 0 ; i < n ; i++){
            arr[i] = obj.nextInt();
        }

        int []ans = new int[n];
        Arrays.fill(ans, -1);
        //System.out.println(solute(arr,n-1));
        //System.out.println(soluteTopBottom(arr,n-1,ans));
        System.out.println(soluteBottomUp(arr,n-1,ans));
    } Reader obj = new Reader(); obj new Reader() int n = obj.nextInt(); n obj.nextInt() obj.nextInt obj int []arr = new int[n]; arr new int[n] n for(int i = 0 ; i < n ; i++){
            arr[i] = obj.nextInt();
        } int i = 0 ; int i = 0 ; i 0 i < n i n i++ i++ i {
            arr[i] = obj.nextInt();
        } {
            arr[i] = obj.nextInt();
        } arr[i] = obj.nextInt() arr[i] arr i obj.nextInt() obj.nextInt obj int []ans = new int[n]; ans new int[n] n Arrays.fill(ans, -1) Arrays.fill Arrays ans -1 1 System.out.println(soluteBottomUp(arr,n-1,ans)) System.out.println System.out System System.out soluteBottomUp(arr,n-1,ans) soluteBottomUp arr n-1 n 1 ans String []args args static class Reader 
    { 
        final private int BUFFER_SIZE = 1 << 16; 
        private DataInputStream din; 
        private byte[] buffer; 
        private int bufferPointer, bytesRead; 
  
        public Reader() 
        { 
            din = new DataInputStream(System.in); 
            buffer = new byte[BUFFER_SIZE]; 
            bufferPointer = bytesRead = 0; 
        } 
  
        public Reader(String file_name) throws IOException 
        { 
            din = new DataInputStream(new FileInputStream(file_name)); 
            buffer = new byte[BUFFER_SIZE]; 
            bufferPointer = bytesRead = 0; 
        } 
  
        public String readLine() throws IOException 
        { 
            byte[] buf = new byte[64]; // line length 
            int cnt = 0, c; 
            while ((c = read()) != -1) 
            { 
                if (c == '\n') 
                    break; 
                buf[cnt++] = (byte) c; 
            } 
            return new String(buf, 0, cnt); 
        } 
  
        public int nextInt() throws IOException 
        { 
            int ret = 0; 
            byte c = read(); 
            while (c <= ' ') 
                c = read(); 
            boolean neg = (c == '-'); 
            if (neg) 
                c = read(); 
            do
            { 
                ret = ret * 10 + c - '0'; 
            }  while ((c = read()) >= '0' && c <= '9'); 
  
            if (neg) 
                return -ret; 
            return ret; 
        } 
  
        public long nextLong() throws IOException 
        { 
            long ret = 0; 
            byte c = read(); 
            while (c <= ' ') 
                c = read(); 
            boolean neg = (c == '-'); 
            if (neg) 
                c = read(); 
            do { 
                ret = ret * 10 + c - '0'; 
            } 
            while ((c = read()) >= '0' && c <= '9'); 
            if (neg) 
                return -ret; 
            return ret; 
        } 
  
        public double nextDouble() throws IOException 
        { 
            double ret = 0, div = 1; 
            byte c = read(); 
            while (c <= ' ') 
                c = read(); 
            boolean neg = (c == '-'); 
            if (neg) 
                c = read(); 
  
            do { 
                ret = ret * 10 + c - '0'; 
            } 
            while ((c = read()) >= '0' && c <= '9'); 
  
            if (c == '.') 
            { 
                while ((c = read()) >= '0' && c <= '9') 
                { 
                    ret += (c - '0') / (div *= 10); 
                } 
            } 
  
            if (neg) 
                return -ret; 
            return ret; 
        } 
  
        private void fillBuffer() throws IOException 
        { 
            bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE); 
            if (bytesRead == -1) 
                buffer[0] = -1; 
        } 
  
        private byte read() throws IOException 
        { 
            if (bufferPointer == bytesRead) 
                fillBuffer(); 
            return buffer[bufferPointer++]; 
        } 
  
        public void close() throws IOException 
        { 
            if (din == null) 
                return; 
            din.close(); 
        } 
    } Reader final private int BUFFER_SIZE = 1 << 16; BUFFER_SIZE 1 << 16 1 16 private DataInputStream din; din private byte[] buffer; buffer private int bufferPointer bufferPointer bytesRead; bytesRead public Reader() 
        { 
            din = new DataInputStream(System.in); 
            buffer = new byte[BUFFER_SIZE]; 
            bufferPointer = bytesRead = 0; 
        } Reader { 
            din = new DataInputStream(System.in); 
            buffer = new byte[BUFFER_SIZE]; 
            bufferPointer = bytesRead = 0; 
        } din = new DataInputStream(System.in) din new DataInputStream(System.in) buffer = new byte[BUFFER_SIZE] buffer new byte[BUFFER_SIZE] BUFFER_SIZE bufferPointer = bytesRead = 0 bufferPointer bytesRead = 0 bytesRead 0 public Reader(String file_name) throws IOException 
        { 
            din = new DataInputStream(new FileInputStream(file_name)); 
            buffer = new byte[BUFFER_SIZE]; 
            bufferPointer = bytesRead = 0; 
        } Reader { 
            din = new DataInputStream(new FileInputStream(file_name)); 
            buffer = new byte[BUFFER_SIZE]; 
            bufferPointer = bytesRead = 0; 
        } din = new DataInputStream(new FileInputStream(file_name)) din new DataInputStream(new FileInputStream(file_name)) buffer = new byte[BUFFER_SIZE] buffer new byte[BUFFER_SIZE] BUFFER_SIZE bufferPointer = bytesRead = 0 bufferPointer bytesRead = 0 bytesRead 0 String file_name file_name public String readLine() throws IOException 
        { 
            byte[] buf = new byte[64]; // line length 
            int cnt = 0, c; 
            while ((c = read()) != -1) 
            { 
                if (c == '\n') 
                    break; 
                buf[cnt++] = (byte) c; 
            } 
            return new String(buf, 0, cnt); 
        } readLine { 
            byte[] buf = new byte[64]; // line length 
            int cnt = 0, c; 
            while ((c = read()) != -1) 
            { 
                if (c == '\n') 
                    break; 
                buf[cnt++] = (byte) c; 
            } 
            return new String(buf, 0, cnt); 
        } byte[] buf = new byte[64]; buf new byte[64] 64 int cnt = 0 cnt 0 c; c while ((c = read()) != -1) 
            { 
                if (c == '\n') 
                    break; 
                buf[cnt++] = (byte) c; 
            } (c = read()) != -1 (c = read()) c read() read -1 1 { 
                if (c == '\n') 
                    break; 
                buf[cnt++] = (byte) c; 
            } if (c == '\n') 
                    break; c == '\n' c '\n' break; buf[cnt++] = (byte) c buf[cnt++] buf cnt++ cnt (byte) c return new String(buf, 0, cnt); new String(buf, 0, cnt) public int nextInt() throws IOException 
        { 
            int ret = 0; 
            byte c = read(); 
            while (c <= ' ') 
                c = read(); 
            boolean neg = (c == '-'); 
            if (neg) 
                c = read(); 
            do
            { 
                ret = ret * 10 + c - '0'; 
            }  while ((c = read()) >= '0' && c <= '9'); 
  
            if (neg) 
                return -ret; 
            return ret; 
        } nextInt { 
            int ret = 0; 
            byte c = read(); 
            while (c <= ' ') 
                c = read(); 
            boolean neg = (c == '-'); 
            if (neg) 
                c = read(); 
            do
            { 
                ret = ret * 10 + c - '0'; 
            }  while ((c = read()) >= '0' && c <= '9'); 
  
            if (neg) 
                return -ret; 
            return ret; 
        } int ret = 0; ret 0 byte c = read(); c read() read while (c <= ' ') 
                c = read(); c <= ' ' c ' ' c = read() c read() read boolean neg = (c == '-'); neg (c == '-') c '-' if (neg) 
                c = read(); neg c = read() c read() read do
            { 
                ret = ret * 10 + c - '0'; 
            }  while ((c = read()) >= '0' && c <= '9'); (c = read()) >= '0' && c <= '9' (c = read()) >= '0' (c = read()) c read() read '0' c <= '9' c '9' { 
                ret = ret * 10 + c - '0'; 
            } ret = ret * 10 + c - '0' ret ret * 10 + c - '0' ret * 10 + c ret * 10 ret 10 c '0' if (neg) 
                return -ret; neg return -ret; -ret ret return ret; ret public long nextLong() throws IOException 
        { 
            long ret = 0; 
            byte c = read(); 
            while (c <= ' ') 
                c = read(); 
            boolean neg = (c == '-'); 
            if (neg) 
                c = read(); 
            do { 
                ret = ret * 10 + c - '0'; 
            } 
            while ((c = read()) >= '0' && c <= '9'); 
            if (neg) 
                return -ret; 
            return ret; 
        } nextLong { 
            long ret = 0; 
            byte c = read(); 
            while (c <= ' ') 
                c = read(); 
            boolean neg = (c == '-'); 
            if (neg) 
                c = read(); 
            do { 
                ret = ret * 10 + c - '0'; 
            } 
            while ((c = read()) >= '0' && c <= '9'); 
            if (neg) 
                return -ret; 
            return ret; 
        } long ret = 0; ret 0 byte c = read(); c read() read while (c <= ' ') 
                c = read(); c <= ' ' c ' ' c = read() c read() read boolean neg = (c == '-'); neg (c == '-') c '-' if (neg) 
                c = read(); neg c = read() c read() read do { 
                ret = ret * 10 + c - '0'; 
            } 
            while ((c = read()) >= '0' && c <= '9'); (c = read()) >= '0' && c <= '9' (c = read()) >= '0' (c = read()) c read() read '0' c <= '9' c '9' { 
                ret = ret * 10 + c - '0'; 
            } ret = ret * 10 + c - '0' ret ret * 10 + c - '0' ret * 10 + c ret * 10 ret 10 c '0' if (neg) 
                return -ret; neg return -ret; -ret ret return ret; ret public double nextDouble() throws IOException 
        { 
            double ret = 0, div = 1; 
            byte c = read(); 
            while (c <= ' ') 
                c = read(); 
            boolean neg = (c == '-'); 
            if (neg) 
                c = read(); 
  
            do { 
                ret = ret * 10 + c - '0'; 
            } 
            while ((c = read()) >= '0' && c <= '9'); 
  
            if (c == '.') 
            { 
                while ((c = read()) >= '0' && c <= '9') 
                { 
                    ret += (c - '0') / (div *= 10); 
                } 
            } 
  
            if (neg) 
                return -ret; 
            return ret; 
        } nextDouble { 
            double ret = 0, div = 1; 
            byte c = read(); 
            while (c <= ' ') 
                c = read(); 
            boolean neg = (c == '-'); 
            if (neg) 
                c = read(); 
  
            do { 
                ret = ret * 10 + c - '0'; 
            } 
            while ((c = read()) >= '0' && c <= '9'); 
  
            if (c == '.') 
            { 
                while ((c = read()) >= '0' && c <= '9') 
                { 
                    ret += (c - '0') / (div *= 10); 
                } 
            } 
  
            if (neg) 
                return -ret; 
            return ret; 
        } double ret = 0 ret 0 div = 1; div 1 byte c = read(); c read() read while (c <= ' ') 
                c = read(); c <= ' ' c ' ' c = read() c read() read boolean neg = (c == '-'); neg (c == '-') c '-' if (neg) 
                c = read(); neg c = read() c read() read do { 
                ret = ret * 10 + c - '0'; 
            } 
            while ((c = read()) >= '0' && c <= '9'); (c = read()) >= '0' && c <= '9' (c = read()) >= '0' (c = read()) c read() read '0' c <= '9' c '9' { 
                ret = ret * 10 + c - '0'; 
            } ret = ret * 10 + c - '0' ret ret * 10 + c - '0' ret * 10 + c ret * 10 ret 10 c '0' if (c == '.') 
            { 
                while ((c = read()) >= '0' && c <= '9') 
                { 
                    ret += (c - '0') / (div *= 10); 
                } 
            } c == '.' c '.' { 
                while ((c = read()) >= '0' && c <= '9') 
                { 
                    ret += (c - '0') / (div *= 10); 
                } 
            } while ((c = read()) >= '0' && c <= '9') 
                { 
                    ret += (c - '0') / (div *= 10); 
                } (c = read()) >= '0' && c <= '9' (c = read()) >= '0' (c = read()) c read() read '0' c <= '9' c '9' { 
                    ret += (c - '0') / (div *= 10); 
                } ret += (c - '0') / (div *= 10) ret (c - '0') / (div *= 10) (c - '0') c '0' (div *= 10) div 10 if (neg) 
                return -ret; neg return -ret; -ret ret return ret; ret private void fillBuffer() throws IOException 
        { 
            bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE); 
            if (bytesRead == -1) 
                buffer[0] = -1; 
        } fillBuffer { 
            bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE); 
            if (bytesRead == -1) 
                buffer[0] = -1; 
        } bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE) bytesRead din.read(buffer, bufferPointer = 0, BUFFER_SIZE) din.read din buffer bufferPointer = 0 bufferPointer 0 BUFFER_SIZE if (bytesRead == -1) 
                buffer[0] = -1; bytesRead == -1 bytesRead -1 1 buffer[0] = -1 buffer[0] buffer 0 -1 1 private byte read() throws IOException 
        { 
            if (bufferPointer == bytesRead) 
                fillBuffer(); 
            return buffer[bufferPointer++]; 
        } read { 
            if (bufferPointer == bytesRead) 
                fillBuffer(); 
            return buffer[bufferPointer++]; 
        } if (bufferPointer == bytesRead) 
                fillBuffer(); bufferPointer == bytesRead bufferPointer bytesRead fillBuffer() fillBuffer return buffer[bufferPointer++]; buffer[bufferPointer++] buffer bufferPointer++ bufferPointer public void close() throws IOException 
        { 
            if (din == null) 
                return; 
            din.close(); 
        } close { 
            if (din == null) 
                return; 
            din.close(); 
        } if (din == null) 
                return; din == null din null return; din.close() din.close din public class Main {

    public static int solute(int []arr, int i){
        if(i==0){
            return 0;
        }
        int a = 0 , b = 0;
        if(i >= 2){
            a = Math.abs(arr[i]-arr[i-1]) + solute(arr,i-1);
            b = Math.abs(arr[i]-arr[i-2]) + solute(arr,i-2);
            return Math.min(a,b);
        }else if(i==1){
            return Math.abs(arr[i] - arr[i-1]);
        }
        return -1 ;
    }

    public static int soluteTopBottom(int []arr, int i, int []ans){
        if(i == 0 ){
            ans[0] = 0 ;
            return 0;
        }
        int a = 0 , b = 0;
        if(i >= 2){
            if(ans[i-1]!=-1){
                a = Math.abs(arr[i]-arr[i-1]) + ans[i-1];
            }else{
                a = Math.abs(arr[i]-arr[i-1]) + soluteTopBottom(arr,i-1,ans);
            }

            if(ans[i-2]!=-1){
                b = Math.abs(arr[i]-arr[i-2]) + ans[i-2];
            }else{
                b = Math.abs(arr[i]-arr[i-2]) + soluteTopBottom(arr,i-2,ans);
            }

            return Math.min(a,b);
        }else if(i==1){
            ans[i] = Math.abs(arr[i] - arr[i-1]);
            return ans[i];
        }
        return -1;
    }
    public static int soluteBottomUp(int []arr, int j, int []ans){
        Arrays.fill(ans , 0);
        int a = 0 , b = 0;
        if(arr.length > 1)
            ans[1] = Math.abs(arr[1] - arr[0]);
        for(int i =2 ; i < arr.length ; i++){
            a = Math.abs(arr[i] - arr[i-1])+ans[i-1];
            b = Math.abs(arr[i] - arr[i-2])+ans[i-2];
            ans[i] = Math.min(a,b);
        }   
        return ans[arr.length - 1];
    }

    public static void main(String []args) throws Exception{
        Reader obj = new Reader();
        int n = obj.nextInt();
        int []arr = new int[n];

        for(int i = 0 ; i < n ; i++){
            arr[i] = obj.nextInt();
        }

        int []ans = new int[n];
        Arrays.fill(ans, -1);
        //System.out.println(solute(arr,n-1));
        //System.out.println(soluteTopBottom(arr,n-1,ans));
        System.out.println(soluteBottomUp(arr,n-1,ans));
    }

    static class Reader 
    { 
        final private int BUFFER_SIZE = 1 << 16; 
        private DataInputStream din; 
        private byte[] buffer; 
        private int bufferPointer, bytesRead; 
  
        public Reader() 
        { 
            din = new DataInputStream(System.in); 
            buffer = new byte[BUFFER_SIZE]; 
            bufferPointer = bytesRead = 0; 
        } 
  
        public Reader(String file_name) throws IOException 
        { 
            din = new DataInputStream(new FileInputStream(file_name)); 
            buffer = new byte[BUFFER_SIZE]; 
            bufferPointer = bytesRead = 0; 
        } 
  
        public String readLine() throws IOException 
        { 
            byte[] buf = new byte[64]; // line length 
            int cnt = 0, c; 
            while ((c = read()) != -1) 
            { 
                if (c == '\n') 
                    break; 
                buf[cnt++] = (byte) c; 
            } 
            return new String(buf, 0, cnt); 
        } 
  
        public int nextInt() throws IOException 
        { 
            int ret = 0; 
            byte c = read(); 
            while (c <= ' ') 
                c = read(); 
            boolean neg = (c == '-'); 
            if (neg) 
                c = read(); 
            do
            { 
                ret = ret * 10 + c - '0'; 
            }  while ((c = read()) >= '0' && c <= '9'); 
  
            if (neg) 
                return -ret; 
            return ret; 
        } 
  
        public long nextLong() throws IOException 
        { 
            long ret = 0; 
            byte c = read(); 
            while (c <= ' ') 
                c = read(); 
            boolean neg = (c == '-'); 
            if (neg) 
                c = read(); 
            do { 
                ret = ret * 10 + c - '0'; 
            } 
            while ((c = read()) >= '0' && c <= '9'); 
            if (neg) 
                return -ret; 
            return ret; 
        } 
  
        public double nextDouble() throws IOException 
        { 
            double ret = 0, div = 1; 
            byte c = read(); 
            while (c <= ' ') 
                c = read(); 
            boolean neg = (c == '-'); 
            if (neg) 
                c = read(); 
  
            do { 
                ret = ret * 10 + c - '0'; 
            } 
            while ((c = read()) >= '0' && c <= '9'); 
  
            if (c == '.') 
            { 
                while ((c = read()) >= '0' && c <= '9') 
                { 
                    ret += (c - '0') / (div *= 10); 
                } 
            } 
  
            if (neg) 
                return -ret; 
            return ret; 
        } 
  
        private void fillBuffer() throws IOException 
        { 
            bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE); 
            if (bytesRead == -1) 
                buffer[0] = -1; 
        } 
  
        private byte read() throws IOException 
        { 
            if (bufferPointer == bytesRead) 
                fillBuffer(); 
            return buffer[bufferPointer++]; 
        } 
  
        public void close() throws IOException 
        { 
            if (din == null) 
                return; 
            din.close(); 
        } 
    } 
    


} public class Main {

    public static int solute(int []arr, int i){
        if(i==0){
            return 0;
        }
        int a = 0 , b = 0;
        if(i >= 2){
            a = Math.abs(arr[i]-arr[i-1]) + solute(arr,i-1);
            b = Math.abs(arr[i]-arr[i-2]) + solute(arr,i-2);
            return Math.min(a,b);
        }else if(i==1){
            return Math.abs(arr[i] - arr[i-1]);
        }
        return -1 ;
    }

    public static int soluteTopBottom(int []arr, int i, int []ans){
        if(i == 0 ){
            ans[0] = 0 ;
            return 0;
        }
        int a = 0 , b = 0;
        if(i >= 2){
            if(ans[i-1]!=-1){
                a = Math.abs(arr[i]-arr[i-1]) + ans[i-1];
            }else{
                a = Math.abs(arr[i]-arr[i-1]) + soluteTopBottom(arr,i-1,ans);
            }

            if(ans[i-2]!=-1){
                b = Math.abs(arr[i]-arr[i-2]) + ans[i-2];
            }else{
                b = Math.abs(arr[i]-arr[i-2]) + soluteTopBottom(arr,i-2,ans);
            }

            return Math.min(a,b);
        }else if(i==1){
            ans[i] = Math.abs(arr[i] - arr[i-1]);
            return ans[i];
        }
        return -1;
    }
    public static int soluteBottomUp(int []arr, int j, int []ans){
        Arrays.fill(ans , 0);
        int a = 0 , b = 0;
        if(arr.length > 1)
            ans[1] = Math.abs(arr[1] - arr[0]);
        for(int i =2 ; i < arr.length ; i++){
            a = Math.abs(arr[i] - arr[i-1])+ans[i-1];
            b = Math.abs(arr[i] - arr[i-2])+ans[i-2];
            ans[i] = Math.min(a,b);
        }   
        return ans[arr.length - 1];
    }

    public static void main(String []args) throws Exception{
        Reader obj = new Reader();
        int n = obj.nextInt();
        int []arr = new int[n];

        for(int i = 0 ; i < n ; i++){
            arr[i] = obj.nextInt();
        }

        int []ans = new int[n];
        Arrays.fill(ans, -1);
        //System.out.println(solute(arr,n-1));
        //System.out.println(soluteTopBottom(arr,n-1,ans));
        System.out.println(soluteBottomUp(arr,n-1,ans));
    }

    static class Reader 
    { 
        final private int BUFFER_SIZE = 1 << 16; 
        private DataInputStream din; 
        private byte[] buffer; 
        private int bufferPointer, bytesRead; 
  
        public Reader() 
        { 
            din = new DataInputStream(System.in); 
            buffer = new byte[BUFFER_SIZE]; 
            bufferPointer = bytesRead = 0; 
        } 
  
        public Reader(String file_name) throws IOException 
        { 
            din = new DataInputStream(new FileInputStream(file_name)); 
            buffer = new byte[BUFFER_SIZE]; 
            bufferPointer = bytesRead = 0; 
        } 
  
        public String readLine() throws IOException 
        { 
            byte[] buf = new byte[64]; // line length 
            int cnt = 0, c; 
            while ((c = read()) != -1) 
            { 
                if (c == '\n') 
                    break; 
                buf[cnt++] = (byte) c; 
            } 
            return new String(buf, 0, cnt); 
        } 
  
        public int nextInt() throws IOException 
        { 
            int ret = 0; 
            byte c = read(); 
            while (c <= ' ') 
                c = read(); 
            boolean neg = (c == '-'); 
            if (neg) 
                c = read(); 
            do
            { 
                ret = ret * 10 + c - '0'; 
            }  while ((c = read()) >= '0' && c <= '9'); 
  
            if (neg) 
                return -ret; 
            return ret; 
        } 
  
        public long nextLong() throws IOException 
        { 
            long ret = 0; 
            byte c = read(); 
            while (c <= ' ') 
                c = read(); 
            boolean neg = (c == '-'); 
            if (neg) 
                c = read(); 
            do { 
                ret = ret * 10 + c - '0'; 
            } 
            while ((c = read()) >= '0' && c <= '9'); 
            if (neg) 
                return -ret; 
            return ret; 
        } 
  
        public double nextDouble() throws IOException 
        { 
            double ret = 0, div = 1; 
            byte c = read(); 
            while (c <= ' ') 
                c = read(); 
            boolean neg = (c == '-'); 
            if (neg) 
                c = read(); 
  
            do { 
                ret = ret * 10 + c - '0'; 
            } 
            while ((c = read()) >= '0' && c <= '9'); 
  
            if (c == '.') 
            { 
                while ((c = read()) >= '0' && c <= '9') 
                { 
                    ret += (c - '0') / (div *= 10); 
                } 
            } 
  
            if (neg) 
                return -ret; 
            return ret; 
        } 
  
        private void fillBuffer() throws IOException 
        { 
            bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE); 
            if (bytesRead == -1) 
                buffer[0] = -1; 
        } 
  
        private byte read() throws IOException 
        { 
            if (bufferPointer == bytesRead) 
                fillBuffer(); 
            return buffer[bufferPointer++]; 
        } 
  
        public void close() throws IOException 
        { 
            if (din == null) 
                return; 
            din.close(); 
        } 
    } 
    


} Main
import java.io.*; 
import java.util.*;

class Compare implements Comparator<Pair>{
    public int compare(Pair a, Pair b){
        return a.y - b.y;
    }
}

class Pair{
    String x;
    int y;

    Pair(String a, int b){
        x = a;
        y = b;
    }
}

public class Main {

    public static int solute(int []arr, int i){
        if(i==0){
            return 0;
        }
        int a = 0 , b = 0;
        if(i >= 2){
            a = Math.abs(arr[i]-arr[i-1]) + solute(arr,i-1);
            b = Math.abs(arr[i]-arr[i-2]) + solute(arr,i-2);
            return Math.min(a,b);
        }else if(i==1){
            return Math.abs(arr[i] - arr[i-1]);
        }
        return -1 ;
    }

    public static int soluteTopBottom(int []arr, int i, int []ans){
        if(i == 0 ){
            ans[0] = 0 ;
            return 0;
        }
        int a = 0 , b = 0;
        if(i >= 2){
            if(ans[i-1]!=-1){
                a = Math.abs(arr[i]-arr[i-1]) + ans[i-1];
            }else{
                a = Math.abs(arr[i]-arr[i-1]) + soluteTopBottom(arr,i-1,ans);
            }

            if(ans[i-2]!=-1){
                b = Math.abs(arr[i]-arr[i-2]) + ans[i-2];
            }else{
                b = Math.abs(arr[i]-arr[i-2]) + soluteTopBottom(arr,i-2,ans);
            }

            return Math.min(a,b);
        }else if(i==1){
            ans[i] = Math.abs(arr[i] - arr[i-1]);
            return ans[i];
        }
        return -1;
    }
    public static int soluteBottomUp(int []arr, int j, int []ans){
        Arrays.fill(ans , 0);
        int a = 0 , b = 0;
        if(arr.length > 1)
            ans[1] = Math.abs(arr[1] - arr[0]);
        for(int i =2 ; i < arr.length ; i++){
            a = Math.abs(arr[i] - arr[i-1])+ans[i-1];
            b = Math.abs(arr[i] - arr[i-2])+ans[i-2];
            ans[i] = Math.min(a,b);
        }   
        return ans[arr.length - 1];
    }

    public static void main(String []args) throws Exception{
        Reader obj = new Reader();
        int n = obj.nextInt();
        int []arr = new int[n];

        for(int i = 0 ; i < n ; i++){
            arr[i] = obj.nextInt();
        }

        int []ans = new int[n];
        Arrays.fill(ans, -1);
        //System.out.println(solute(arr,n-1));
        //System.out.println(soluteTopBottom(arr,n-1,ans));
        System.out.println(soluteBottomUp(arr,n-1,ans));
    }

    static class Reader 
    { 
        final private int BUFFER_SIZE = 1 << 16; 
        private DataInputStream din; 
        private byte[] buffer; 
        private int bufferPointer, bytesRead; 
  
        public Reader() 
        { 
            din = new DataInputStream(System.in); 
            buffer = new byte[BUFFER_SIZE]; 
            bufferPointer = bytesRead = 0; 
        } 
  
        public Reader(String file_name) throws IOException 
        { 
            din = new DataInputStream(new FileInputStream(file_name)); 
            buffer = new byte[BUFFER_SIZE]; 
            bufferPointer = bytesRead = 0; 
        } 
  
        public String readLine() throws IOException 
        { 
            byte[] buf = new byte[64]; // line length 
            int cnt = 0, c; 
            while ((c = read()) != -1) 
            { 
                if (c == '\n') 
                    break; 
                buf[cnt++] = (byte) c; 
            } 
            return new String(buf, 0, cnt); 
        } 
  
        public int nextInt() throws IOException 
        { 
            int ret = 0; 
            byte c = read(); 
            while (c <= ' ') 
                c = read(); 
            boolean neg = (c == '-'); 
            if (neg) 
                c = read(); 
            do
            { 
                ret = ret * 10 + c - '0'; 
            }  while ((c = read()) >= '0' && c <= '9'); 
  
            if (neg) 
                return -ret; 
            return ret; 
        } 
  
        public long nextLong() throws IOException 
        { 
            long ret = 0; 
            byte c = read(); 
            while (c <= ' ') 
                c = read(); 
            boolean neg = (c == '-'); 
            if (neg) 
                c = read(); 
            do { 
                ret = ret * 10 + c - '0'; 
            } 
            while ((c = read()) >= '0' && c <= '9'); 
            if (neg) 
                return -ret; 
            return ret; 
        } 
  
        public double nextDouble() throws IOException 
        { 
            double ret = 0, div = 1; 
            byte c = read(); 
            while (c <= ' ') 
                c = read(); 
            boolean neg = (c == '-'); 
            if (neg) 
                c = read(); 
  
            do { 
                ret = ret * 10 + c - '0'; 
            } 
            while ((c = read()) >= '0' && c <= '9'); 
  
            if (c == '.') 
            { 
                while ((c = read()) >= '0' && c <= '9') 
                { 
                    ret += (c - '0') / (div *= 10); 
                } 
            } 
  
            if (neg) 
                return -ret; 
            return ret; 
        } 
  
        private void fillBuffer() throws IOException 
        { 
            bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE); 
            if (bytesRead == -1) 
                buffer[0] = -1; 
        } 
  
        private byte read() throws IOException 
        { 
            if (bufferPointer == bytesRead) 
                fillBuffer(); 
            return buffer[bufferPointer++]; 
        } 
  
        public void close() throws IOException 
        { 
            if (din == null) 
                return; 
            din.close(); 
        } 
    } 
    


} 
