c++ language

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 X2, and the third friend lives at the point xz. 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 X1, X2 and x3 (1sXq,X2,X35 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 i to the point 4), while the third friend should not go anywhere because he lives at the point 4