import java.util.Scanner;
 
public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
       long[] b=new long[n+1];
       for(int i=1;i<=n;i++){
       	b[i]=sc.nextLong();
       }
       long[] dp=new long[n+1];
       //storing the best difference so far
       dp[0]=0;
       dp[1]=Math.abs(b[1]-b[2]);
       for(int i=3;i<=n;i++){
       	//for each ith stone, i can reach there from i-1 or i-2 stone
       	//for i-1 stone u have to first add up the dp[i-1] value there 
       	//then add ith stones difference from i-1
       	dp[i]=Math.min(dp[i-1]+Math.abs(b[i]-b[i-1]),dp[i-2]+Math.abs(b[i]-b[i-2]));
       }
       System.out.println(dp[n]);
    }
}
 

aW1wb3J0IGphdmEudXRpbC5TY2FubmVyOwoKcHVibGljIGNsYXNzIE1haW4gewogICAgcHVibGljIHN0YXRpYyB2b2lkIG1haW4oU3RyaW5nW10gYXJncykgewogICAgICAgIFNjYW5uZXIgc2MgPSBuZXcgU2Nhbm5lcihTeXN0ZW0uaW4pOwogICAgICAgIGludCBuID0gc2MubmV4dEludCgpOwogICAgICAgbG9uZ1tdIGI9bmV3IGxvbmdbbisxXTsKICAgICAgIGZvcihpbnQgaT0xO2k8PW47aSsrKXsKICAgICAgIAliW2ldPXNjLm5leHRMb25nKCk7CiAgICAgICB9CiAgICAgICBsb25nW10gZHA9bmV3IGxvbmdbbisxXTsKICAgICAgIC8vc3RvcmluZyB0aGUgYmVzdCBkaWZmZXJlbmNlIHNvIGZhcgogICAgICAgZHBbMF09MDsKICAgICAgIGRwWzFdPU1hdGguYWJzKGJbMV0tYlsyXSk7CiAgICAgICBmb3IoaW50IGk9MztpPD1uO2krKyl7CiAgICAgICAJLy9mb3IgZWFjaCBpdGggc3RvbmUsIGkgY2FuIHJlYWNoIHRoZXJlIGZyb20gaS0xIG9yIGktMiBzdG9uZQogICAgICAgCS8vZm9yIGktMSBzdG9uZSB1IGhhdmUgdG8gZmlyc3QgYWRkIHVwIHRoZSBkcFtpLTFdIHZhbHVlIHRoZXJlIAogICAgICAgCS8vdGhlbiBhZGQgaXRoIHN0b25lcyBkaWZmZXJlbmNlIGZyb20gaS0xCiAgICAgICAJZHBbaV09TWF0aC5taW4oZHBbaS0xXStNYXRoLmFicyhiW2ldLWJbaS0xXSksZHBbaS0yXStNYXRoLmFicyhiW2ldLWJbaS0yXSkpOwogICAgICAgfQogICAgICAgU3lzdGVtLm91dC5wcmludGxuKGRwW25dKTsKICAgIH0KfQo=

4oCoNAoxMCAzMCA0MCAyMAo=


4
10 30 40 20