Walk

Before the contest, you decided to buy three types of candies, but unfortunately, all candies are sold in separate stores. The first type of candy is sold in the first store, the second type is sold in the second store, and the third type is sold in the third store. You are on the coordinate line at point 0, and the candy stores of the first, second and third types have coordinates $a$, $b$ and $c$ respectively. You can move left or right one cell per second. Find the minimum number of seconds it takes to visit all three stores.

Input

The first line contains three integers $a$, $b$, $c$ ($-10^6\le a,b,c\le 10^6$) - the coordinates of the stores.

Output

Print a single integer - the answer to the problem.

Examples

Note

Explanation for the first example:

Initially, we are at point 0. The optimal option is to first go to the store at coordinate 1, then to the store at coordinate 2 and then to the third store at coordinate 3. The time spent on such a route is $|1-0|$ + $|2-1|$ + $|3-2|$ = $3$.

Explanation for the second example:

The order of visiting the stores does not matter because all three stores are located at the same coordinate $-1$. The time spent on such a route is $|-1-0|$ + $|-1-(-1)|$ + $|-1-(-1)|$ = $1$.