import java.util.Arrays;
import java.util.Scanner;

class Main {
    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);
        int stones = s.nextInt();
        int arr[] = new int[stones];
        for(int i= 0;i<stones;i++){
            arr[i] = s.nextInt();
        }
        long dp[] = new long[stones];
        dp[0] = 0;
        for(int i= 1;i<stones;i++){
            long option1 = Math.abs(arr[i]-arr[i-1])+dp[i-1];
            long option2 = i==1?Integer.MAX_VALUE:Math.abs(arr[i]-arr[i-2])+dp[i-2];
            dp[i] = Math.min(option1,option2);
        }
        System.out.println(dp[stones-1]);
    }
}

/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz