#AT1. Frog 1

Frog 1

Original Problem Statement (English)

Source: AtCoder Educational DP Contest - Problem A

Problem Statement

There are NN stones, numbered 1,2,…,N1, 2, \ldots, N. For each ii (1≤i≤N1 \leq i \leq N), the height of Stone ii is hih_i.

There is a frog who is initially on Stone 11. He will repeat the following action some number of times to reach Stone NN:

  • If the frog is currently on Stone ii, jump to Stone i+1i + 1 or Stone i+2i + 2. Here, a cost of ∣hi−hj∣|h_i - h_j| is incurred, where jj is the stone to land on.

Find the minimum possible total cost incurred before the frog reaches Stone NN.

Constraints

  • All values in input are integers.
  • 2≤N≤1052 \leq N \leq 10^5
  • 1≤hi≤1041 \leq h_i \leq 10^4

Input

Input is given from Standard Input in the following format:

N
h_1 h_2 \ldots h_N

Output

Print the minimum possible total cost incurred.

Sample Input 1

4
10 30 40 20

Sample Output 1

30

If we follow the path 11 → 22 → 44, the total cost incurred would be ∣10−30∣+∣30−20∣=30|10 - 30| + |30 - 20| = 30.

Sample Input 2

2
10 10

Sample Output 2

0

If we follow the path 11 → 22, the total cost incurred would be ∣10−10∣=0|10 - 10| = 0.

Sample Input 3

6
30 10 60 10 60 50

Sample Output 3

40

If we follow the path 11 → 33 → 55 → 66, the total cost incurred would be ∣30−60∣+∣60−60∣+∣60−50∣=40|30 - 60| + |60 - 60| + |60 - 50| = 40.