Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

A. The New Year: Meeting Friends

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputThere are three friend living on the straight line *Ox* in Lineland. The first friend lives at the point *x*_{1}, the second friend lives at the point *x*_{2}, and the third friend lives at the point *x*_{3}. They plan to celebrate the New Year together, so they need to meet at one point. What is the minimum total distance they have to travel in order to meet at some point and celebrate the New Year?

It's guaranteed that the optimal answer is always integer.

Input

The first line of the input contains three distinct integers *x*_{1}, *x*_{2} and *x*_{3} (1 ≤ *x*_{1}, *x*_{2}, *x*_{3} ≤ 100) — the coordinates of the houses of the first, the second and the third friends respectively.

Output

Print one integer — the minimum total distance the friends need to travel in order to meet together.

Examples

Input

7 1 4

Output

6

Input

30 20 10

Output

20

Note

In the first sample, friends should meet at the point 4. Thus, the first friend has to travel the distance of 3 (from the point 7 to the point 4), the second friend also has to travel the distance of 3 (from the point 1 to the point 4), while the third friend should not go anywhere because he lives at the point 4.

Codeforces (c) Copyright 2010-2018 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Mar/24/2018 09:34:19 (d1).

Desktop version, switch to mobile version.

User lists

Name |
---|