The New Year: Meeting Friends

Description:

Input:

The first line of the input contains three distinct integers x₁, x₂ and x₃ (1 ≤ x₁, x₂, x₃ ≤ 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.

Sample Input:

7 1 4

Sample Output:

6

Sample Input:

30 20 10

Sample 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.