

import java.util.Scanner;

class Main {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int N = in.nextInt();
        int[] h = new int[N];
        for (int i = 0; i < N; i++) h[i] = in.nextInt();
        System.out.println(minCost(h, N));
    }

    public static int minCost(int[] h, int N) {
        int st1 = 0;
        int st2 = Math.abs(h[1] - h[0]);
        for (int i = 2; i < N; i++) {
            int next = Math.min(st2 + Math.abs(h[i] - h[i-1]), st1 + Math.abs(h[i] - h[i-2]));
            st1 = st2;
            st2 = next;
        }
        return st2;
    }
}

/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