import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		long[] dp = new long[n];
		long[] h = new long[n];
		for(int i = 0; i < n ; i++) {
			h[i] = sc.nextLong();
		}
		for(int i = 0 ; i < n ; i ++) {
			if(i == 0) {
				dp[i] = 0;
			}
			else if(i == 1) {
				dp[i] = Math.abs(h[i] - h[i - 1]);
			}
			else {
				dp[i] = Math.min(dp[i - 2] + Math.abs(h[i] - h[i - 2]), dp[i - 1] + Math.abs(h[i] - h[i - 1]));
			}
		}

		System.out.println(dp[n - 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