Problem:
Score : 300 points

Problem Statement

You are given three integers A, B and C. Find the minimum number of operations required to make A, B and C all equal by repeatedly performing the following two kinds of operations in any order:

Choose two among A, B and C, then increase both by 1.

Choose one among A, B and C, then increase it by 2.

It can be proved that we can always make A, B and C all equal by repeatedly performing these operations.

Constraints

0 \leq A,B,C \leq 50

All values in input are integers.

Input

Input is given from Standard Input in the following format:

A B C

Output

Print the minimum number of operations required to make A, B and C all equal.

Sample Input 1

2 5 4

Sample Output 1

2

We can make A, B and C all equal by the following operations:

Increase A and C by 1. Now, A, B, C are 3, 5, 5, respectively.

Increase A by 2. Now, A, B, C are 5, 5, 5, respectively.

Sample Input 2

2 6 3

Sample Output 2

5

Sample Input 3

31 41 5

Sample Output 3

23

Solution in Go (1.14.1) (judge verdict: Wrong Answer)

// minをmaxにして残ったのをなんとかする
// なぜか2WA 意味不明 [0 1 1] -> [1 1 2] で[3 3 3]にしてしまっていたっぽい
// なんでふたつまえの提出でWAをくらったのかまるで理解できない たぶんジャッジがバグってるよ
package main
import (
	"fmt"
	"sort"
)
func main(){
	A := make([]int, 3)
	for i:=0; i<3; i++{
		fmt.Scan(&A[i])
	}
	sort.Ints(A)
	minimum, maximum := A[0], A[2]
	ans := 0
	if (maximum-minimum)%2 == 0{
		// ひたすら2だけやる
		ans += (maximum-minimum)/2
		A[0] = A[2]
	}else{
		// 1回だけ1をまぜる そのときA[1]にも加算
		ans += (maximum-minimum)/2 + 1
		A[0] = A[2]
		A[1]++
	}
	sort.Ints(A)
	fmt.Println(A, ans)
	if A[0]==A[1] && A[1] == A[2]{
		fmt.Println(ans)
	}else{
		if (A[2]-A[0]) % 2 == 1{
			if A[2]-A[0] == 1{
				fmt.Println(ans+1)
				return
			}else{
				A[1]++
				A[2]++
				ans++
			}
		}
		ans += (A[2] - A[0])/2
		fmt.Println(ans)
	}
}