문제

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.

예제 입력 1

2 3 5

예제 출력 1

1

예제 입력 2

3 5 9

예제 출력 2

3