Three kangaroos are playing in the desert. They are playing on a number line, each occupying a different integer. In a single move, one of the outer kangaroos jumps into the space between the other two. At no point may two kangaroos occupy the same position. Help them play as long as possible.


Three integers $A$, $B$ and $C$ ($0 < A < B < C < 100$), the initial positions of the kangaroos.


Output the largest number of moves the kangaroos can make.

Sample Input 1 Sample Output 1
2 3 5
Sample Input 2 Sample Output 2
3 5 9
CPU Time limit 1 second
Memory limit 1024 MB
Statistics Show
License For educational use only

Please log in to submit a solution to this problem

Log in