Competitions

# Dynamic Programming - Linear

# Frog

There are **n** stones, numbered 1, 2, ..., **n**. For each **i** (**1** ≤ **i** ≤ **n**), the height of stone **i** is `h`

. There is a frog who is initially on stone _{i}**1**. It 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`

| is incurred, where _{j}**j** is the stone to land on.

Find the minimum possible total cost incurred before the frog reaches stone **n**.

#### Input

First line contains number **n** (**2** ≤ **n** ≤ `10`

). Second line contains integers ^{5}`h`

, _{1}`h`

, ..., _{2}`h`

(_{n}**1** ≤ `h`

≤ _{i}`10`

).^{4}

#### Output

Print the minimum possible total cost for frog to reach stone **n**.

Input example #1

4 10 30 40 20

Output example #1

30