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 C# (Mono 4.6.2.0) (judge verdict: Accepted)

using System;
using System.Collections.Generic;
class Program
{
	static void Main(string[] args)
	{
		string[] str = Console.ReadLine().Split();
		int A = int.Parse(str[0]);
		int B = int.Parse(str[1]);
		int C = int.Parse(str[2]);
		int tmp = 0;
		if(A>B){
			tmp = B;
			B = A;
			A = tmp;
		}
		if(B>C){
			tmp = C;
			C = B;
			B = tmp;
		}
		if(A>B){
			tmp = B;
			B = A;
			A = tmp;
		}
		int count = 0;
		while(B<=C-2){
			count += 1;
			B += 2;
		}
		while(A<=B-2){
			count += 1;
			A += 2;
		}
		if(A<B && B<C){
			count += 3;
		} else if(A<B){
			count += 2;
		} else if(B<C){
			count += 1;
		}
		Console.WriteLine(count);
	}
}