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: Wrong Answer)

    using System;
    using System.Linq;
    using System.Collections.Generic;
    using static System.Math;


    public class Program
    {
        public static void Main(string[] args)
        {
            List<int> number = Console.ReadLine().Split(' ').Select(int.Parse).ToList();
            int answer = 0;

            if (number.GroupBy(x => x).Count() != 1)
            {
                if (number.Where(x => x % 2 == 1).Count() == 1)
                {
                    List<int> idx1 = number.Select((n, m) => new { value = n, index = m }).Where(x => x.value % 2 == 0).Select(o => o.index).ToList();
                    foreach (int k in idx1) number[k]++;
                    answer++;
                }
                if (number.Where(x => x % 2 == 1).Count() == 2)
                {
                    List<int> idx1 = number.Select((n, m) => new { value = n, index = m }).Where(x => x.value % 2 == 0).Select(o => o.index).ToList();
                    foreach (int k in idx1) number[k]++;
                    answer++;
                }

                while (number.GroupBy(x => x).Count() != 1)
                {
                    if (number.Min() < number.Max())
                    {
                        int idx;
                        idx = number.IndexOf(number.Min());

                        number[idx] = number.Min() + 2;
                        answer++;
                    }
                }
            }

            Console.WriteLine(answer);
        }
    }