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 Python (3.4.3) (judge verdict: Accepted)

# import bisect
# from collections import Counter, deque
# import copy
# from fractions import gcd
# from functools import reduce
# from itertools import accumulate, permutations, combinations, combinations_with_replacement, groupby, product
# import math
# import numpy as np
import sys
sys.setrecursionlimit(10 ** 5 + 10)
# input = sys.stdin.readline

def resolve():

    L=list(map(int,input().split()))
    l=[0,0,0]

    for i in range(3):
        if L[i]%2!=0:
            l[i]=1
    cnt=0
    if l.count(0)==2:
        index_num = [n for n, v in enumerate(l) if v %2==0]
        for j in index_num:
            L[j]+=1
        cnt+=1
    elif l.count(0)==1:
        index_num = [n for n, v in enumerate(l) if v %2==1]
        for j in index_num:
            L[j]+=1
        cnt+=1

    L.sort()
    print(cnt+(L[-1]-L[0])//2+(L[-1]-L[1])//2)



resolve()