题解 | #三角形的边#

def tria_max(a, b, c):


    if a>b and a>c:
        return a
    if b>a and b>c:
        return b
    if c>a and c>b:
        return c
    
    
def tria_mid(a, b, c):
    if (a>b and a<c) or (a<b and a>c) or (a == b and a < c):
        return a
    if b>a and b<c or b <a and b > c or c == b and c < a:
        return b
    if c>a and c<b or c<a and c>b or a == c and a < b:
        return c
    
   
def tria_min(a, b, c):
    if a<b and a<c or (a == b and a < c):
        return a
    if b<a and b<c or (c == b and c < a):
        return b
    if c<a and c<b or (a == c and a < b):
        return c
    





while True:
    try:
        a, b, c = map(int, input().split())
        min=tria_min(a, b, c)
        mid=tria_mid(a, b, c)
        max=tria_max(a, b, c)
        #print("%d %d %d"%(min, mid, max))
        print((min + mid)-max)
    except:
        break