#include <iostream>
#include <set>
#include <queue>
#include <vector>
#include <cstring>
using namespace std;
const int maxn = 1e5 + 10;
const int INF = 2e9;
int n, a[maxn];

int dp[maxn];
int rec(int at) {
    if(at == n - 1) {
        return 0;
    }

    if(dp[at] != -1) {
        return dp[at];
    }

    int res = INF;

    if(at + 1 < n) {
        int cost = abs(a[at] - a[at + 1]);
        int res1 = rec(at + 1) + cost;
        res = min(res, res1);
    }

    if(at + 2 < n) {
        int cost = abs(a[at] - a[at + 2]);
        int res2 = rec(at + 2) + cost;
        res = min(res, res2);
    }

    dp[at] = res;
    return res;
}
int main() {
    ios::sync_with_stdio(false);
    memset(dp, -1, sizeof dp);

    cin >> n;

    for(int i = 0; i < n; i++) {
        cin >> a[i];
    }

    cout << rec(0) << endl;
    return 0;
}