awfr

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
    int n;
    cin >> n;
    vector <int> dp(n);
    vector <int> a(n-1);
    for (int i = 0; i<n; i++) {
        int x;
        cin >> x;
        a[i]=x;
    } dp[0]=0;
    dp[1]=abs(a[0]);
    for (int i = 2; i<=n; i++) {
        dp[i] = min(abs(a[i-1] - a[i-2]) + dp[i - 1], 3 * abs(a[i] - a[i-2] + dp[i - 2]));
    }
    cout << dp[n];

    return 0;
}