There are $N$ stones, numbered $1,2,…,N$. For each $i\ (1≤i≤N)$, the height of Stone $i$ is $h_i$.
There is a frog who is initially on Stone $1$. He will repeat the following action some number of times to reach Stone $N$:

• If the frog is currently on Stone $i$, jump to Stone $i + 1$ or Stone $i + 2$. Here, a cost of $|h_i - h_j|$ is incurred, where $j$ is the stone to land on.

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

Input is given from Standard Input in the following format:
$N$
$h_1\ h_2\ \ldots\ h_N$

Print the minimum possible total cost incurred.

All values in input are integers.
$2 \leq N \leq 10^5$
$1 \leq h_i \leq 10^4$

30

If we follow the path $1 \to 2 \to4$, the total cost incurred would be $|10 - 30| + |30 - 20| = 30$.

0

If we follow the path $1 \to 2$, the total cost incurred would be $|10 - 10| = 0$.

40

If we follow the path $1\to 3 \to 5 \to 6$, the total cost incurred would be $|30 - 60| + |60 - 60| + |60 - 50| = 40$.