#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> arr(n);
for(int i=0; i<n; i++) {
cin >> arr[i];
}
vector<int> dp(n, 0);
dp[0] = 0;
dp[1] = abs(arr[0] - arr[1]);
for(int i=2; i<n; i++) {
dp[i] = min(abs(arr[i-1]-arr[i])+dp[i-1], abs(arr[i-2]-arr[i])+dp[i-2]);
}
cout << "Minimum Jumps : " << dp[n-1];
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpIHsKCWludCBuOwoJY2luID4+IG47CgkKCXZlY3RvcjxpbnQ+IGFycihuKTsKCQoJZm9yKGludCBpPTA7IGk8bjsgaSsrKSB7CgkJY2luID4+IGFycltpXTsKCX0KCQoJdmVjdG9yPGludD4gZHAobiwgMCk7CgkKCWRwWzBdID0gMDsKCWRwWzFdID0gYWJzKGFyclswXSAtIGFyclsxXSk7CgkKCWZvcihpbnQgaT0yOyBpPG47IGkrKykgewoJCWRwW2ldID0gbWluKGFicyhhcnJbaS0xXS1hcnJbaV0pK2RwW2ktMV0sIGFicyhhcnJbaS0yXS1hcnJbaV0pK2RwW2ktMl0pOwoJfQoJCgljb3V0IDw8ICJNaW5pbXVtIEp1bXBzIDogIiA8PCBkcFtuLTFdOwoJCglyZXR1cm4gMDsKfQ==