Submit solution

Points:
5

Time limit:
1.0s

Memory limit:
32M

Problem type

Allowed languages

Ada, Assembly, Awk, Brain****, C, C#, C++, COBOL, ~~CommonLisp~~, D, Dart, F#, Forth, Fortran, Go, ~~Groovy~~, Haskell, Intercal, Java, JS, Kotlin, Lisp, Lua, ~~Nim~~, ~~ObjC~~, OCaml, ~~Octave~~, Pascal, Perl, PHP, Pike, Prolog, Python, Racket, Ruby, Rust, Scala, Scheme, Sed, Swift, TCL, Text, Turing, VB, Zig

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.

#### Input Specification

Three integers , and , the initial positions of the kangaroos.

#### Output Specification

Output the largest number of moves the kangaroos can make.

#### Sample Input 1

`2 3 5`

#### Sample Output 1

`1`

#### Sample Input 2

`3 5 9`

#### Sample Output 2

`3`

## Comments