Codeforce 723A - The New Year: Meeting Friends

Description

There are three friend living on the straight line Ox in Lineland. The first friend lives at the point x₁, the second friend lives at the point x₂, and the third friend lives at the point x₃. 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₁, 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

Input

7 1 4

Output

6

Input

30 20 10

Output

20

题意：在x轴上有3个点，使他们会于一点，求最短的距离。

因为最短的路程就是这条直线覆盖一遍，所以结果就是最大的减去最小的。

#include <cstdio>
#include <algorithm>
using namespace std;

int main()
{
    int a, b, c;
    scanf("%d%d%d", &a, &b, &c);
    printf("%d\n", max(a, max(b, c)) - min(a, min(b, c)));
    return 0;
}