+ Time Limit: 1 second + Memory Limit: 256 megabytes ---------------- We have three containers initially holding $a$, $b$, and $c$ liters of water, respectively. In each step, we can choose two containers and transfer some amount of water (this amount can be fractional/decimal) from one container to the other. The goal is to equalize the amount of water in all three containers. Print the minimum number of necessary moves. # Input Three integers $0 \le a, b, c \le 10^{15}$ are given, representing the amount of water in the three containers. # Output In the single line of output, print the minimum number of steps required to equalize the amount of water in all three containers. # Example ## Sample Input 1 ``` 10 10 10 ``` ## Sample Output 1 ``` 0 ``` ## Sample Input 2 ``` 1 1000 20 ``` ## Sample Output 2 ``` 2 ```