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.
A,B,C=map(int,input().split())
list = [A,B,C]
list.sort(reverse=True)
print(list)
import copy

cnt=0
if (list[0]-list[2])%2==0:
    
    cnt += (list[0]-list[2])/2
    list[2]=copy.deepcopy(list[0])
    if (list[0]-list[1])%2==0:
        cnt += (list[0]-list[1])/2
    else:
        cnt += int((list[0]-list[1])/2)+2
else:
    
    if (list[0]-list[1])%2==0:
        
        cnt += (list[0]-list[1])/2
        cnt += int((list[0]-list[2])/2)+2
    else:
        
        cnt += (list[1]-list[2])/2
        cnt += (list[0]-list[1])
print(int(cnt))
#print(list)

A,B,C=map(int,input().split())
list = [A,B,C]
list.sort(reverse=True)
import copy

cnt=0
if (list[0]-list[2])%2==0:
    
    cnt += (list[0]-list[2])/2
    list[2]=copy.deepcopy(list[0])
    if (list[0]-list[1])%2==0:
        cnt += (list[0]-list[1])/2
    else:
        cnt += int((list[0]-list[1])/2)+2
else:
    
    if (list[0]-list[1])%2==0:
        
        cnt += (list[0]-list[1])/2
        cnt += int((list[0]-list[2])/2)+2
    else:
        
        cnt += (list[1]-list[2])/2
        cnt += (list[0]-list[1])
print(int(cnt))
#print(list)
