Snuke is buying a bicycle. The bicycle of his choice does not come with a bell, so he has to buy one separately.  He has very high awareness of safety, and decides to buy two bells, one for each hand.  The store sells three kinds of bells for the price of a, b and c yen (the currency of Japan), respectively. Find the minimum total price of two different bells.
#66a
a=[]
a.append(input().split())
print(a)
a.sort()
print(int(a[0][1])-int(a[0][0]))
#66a
a,b,c = map(int,input().split())
print(min(a+b,a+c,b+c))