{"raw_statement":[{"iden":"problem statement","content":"There are $N$ stones, numbered $1, 2, \\ldots, N$. For each $i$ ($1 \\leq i \\leq N$), the height of Stone $i$ is $h_i$.\nThere is a frog who is initially on Stone $1$. He will repeat the following action some number of times to reach Stone $N$:\n\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.\n\nFind the minimum possible total cost incurred before the frog reaches Stone $N$."},{"iden":"constraints","content":"*   All values in input are integers.\n*   $2 \\leq N \\leq 10^5$\n*   $1 \\leq h_i \\leq 10^4$"},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$\n$h_1$ $h_2$ $\\ldots$ $h_N$"},{"iden":"sample input 1","content":"4\n10 30 40 20"},{"iden":"sample output 1","content":"30\n\nIf we follow the path $1$ → $2$ → $4$, the total cost incurred would be $|10 - 30| + |30 - 20| = 30$."},{"iden":"sample input 2","content":"2\n10 10"},{"iden":"sample output 2","content":"0\n\nIf we follow the path $1$ → $2$, the total cost incurred would be $|10 - 10| = 0$."},{"iden":"sample input 3","content":"6\n30 10 60 10 60 50"},{"iden":"sample output 3","content":"40\n\nIf we follow the path $1$ → $3$ → $5$ → $6$, the total cost incurred would be $|30 - 60| + |60 - 60| + |60 - 50| = 40$."}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}