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.

-----Constraints-----
 - 1 \leq a,b,c \leq 10000
 - a, b and c are integers.

-----Input-----
Input is given from Standard Input in the following format:
a b c

-----Output-----
Print the minimum total price of two different bells.

-----Sample Input-----
700 600 780

-----Sample Output-----
1300

 - Buying a 700-yen bell and a 600-yen bell costs 1300 yen.
 - Buying a 700-yen bell and a 780-yen bell costs 1480 yen.
 - Buying a 600-yen bell and a 780-yen bell costs 1380 yen.
The minimum among these is 1300 yen.

Difficulty: introductory

Starter code:

Solutions:
# A - ringring
# https://atcoder.jp/contests/abc066/tasks/abc066_a

a = list(map(int, input().split()))

a.sort()
print((a[0] + a[1]))


a, b, c = map(int, input().split())

print(min(a+b, b+c, c+a))

# A - ringring
def main():
    abc = list(map(int, input().split()))
    abc.sort()
    cnt = 0

    for _ in range(2):
        cnt += abc.pop(0)
    else:
        print(cnt)


if __name__ ==  "__main__":
    main()

l = list(map(int, input().split()))


l.sort()

print(l[0] + l[1])

a,b,c = sorted(map(int,input().split()))
print(a+b)

data = list(map(int,input().split()))
data.sort()
print(data[0]+data[1])

a,b,c = list(map(int,input().split()))

print((min(a+b,a+c,b+c)))


a, b, c = map(int, input().split())

print(min(a + b, b + c, c + a))

a,b,c=(int(x) for x in input().split())

X=[a,b,c]
X.sort()

Y=X[0]+X[1]

print(Y)

# 066a

def atc_066a(abc: str) -> int:
    abc_int = [int(ai) for ai in abc.split(" ")]
    abc_int.sort()
    return abc_int[0] + abc_int[1]

abc = input()
print(atc_066a(abc))


a,b,c=list(map(int,input().split()))

print((min(a+b,b+c,a+c)))



'''
問題：
    snuke 君は自転車を買いに来ました。
    snuke 君はすでに買う自転車を決めたのですが、その自転車にはベルが付いていないため、 自転車とは別にベルも買う必要があります。
    snuke 君は安全意識が高いので、ベルをどちらの手でも鳴らせるよう、
    両方のハンドルに 1 つずつ 付けることにしました。

    お店にあるベルは 3 種類で、それぞれ a円、b円、c円です。
    この 3つのうち、異なる 2つのベルを選んで買うときの、値段の合計の最小値を求めて下さい。
'''

'''
制約：
    1 ≤ a,b,c ≤ 10000
    a,b,cは整数
'''

# 標準入力から a, b, c の値を取得する
a, b, c = list(map(int, input().split()))

result = [a + b, b + c, a + c]  # 結果出力用リスト

print((min(result)))


bell=[a, b, c]=list(map(int, input().split(" ")))
candidate=sorted(bell)
print(candidate[0]+candidate[1])

cost = list(map(int, input().split()))
print(sum(sorted(cost)[:2]))

a, b, c = list(map(int,input().split()))

bell_price = [a, b, c]

print((sum(bell_price) - max(bell_price)))


li=a,b,c=list(map(int,input().split()))
print(sorted(li)[0]+sorted(li)[1])

a,b,c = map(int,input().split())
# ベルの価格をリスト化
bell_price = (a,b,c)
# リストの合計値から最高値のベルの値段を除外
print(sum(bell_price)-max(bell_price))

a, b, c, = list(map(int, input().split()))

ring=[]
ring.append(a)
ring.append(b)
ring.append(c)

ring.sort()
print((ring[0] + ring[1]))


lst = input().split()

for i in range(3):
   lst[i] = int(lst[i])

lst.sort()
print(lst[0] + lst[1])

a,b,c=map(int,input().split())

print(a+b+c-max(a,b,c))

# 066a

def atc_066a(abc: str) -> int:
    abc_int = [int(ai) for ai in abc.split(" ")]
    abc_int.sort()
    return abc_int[0] + abc_int[1]

abc = input()
print((atc_066a(abc)))


a=list(map(int,input().split()))
a.sort()
print(sum(a[:2]))

a, b, c = map(int,input().split())

bell_list = []
bell_list.append(a + b)
bell_list.append(b + c)
bell_list.append(a + c)

print(min(bell_list))

a,b,c = map(int,input().split())
bell = [a + b, a + c, b + c]
print(min(bell))

a, b, c = map(int, input().split())
min_price = min(a + b, b + c, a + c)
print(min_price)

a=list(map(int,input().split()))
print((sum(a)-max(a)))


a, b, c = map(int,input().split())

print(min(a + b, b + c, c + a))

bell=[a, b, c]=list(map(int, input().split(" ")))

print(sorted(bell).pop(0)\
      +sorted(bell).pop(1))

a, b, c = map(int, input().split())
print(min(a + b, b + c, a + c))

a,b,c = map(int,input().split())
print(min(a+b,a+c,b+c))

l = sorted(list(map(int, input().split())))
print(sum(l[:2]))

a,b,c=map(int,input().split())
x=[a,b,c]
print(sum(x)-max(x))

print(sum(sorted(map(int, input().split()))[:2]))

a,b,c=map(int,input().split())
s=[]
s.append(a+b)
s.append(a+c)
s.append(b+c)


print(min(s))

a,b,c=map(int,input().split())
x=min(a,b,c)
z=max(a,b,c)
y=a+b+c-x-z
print(x+y)

A = list(map(int, input().split()))

print(sum(sorted(A)[:2]))

a,b,c = list(map(int,input().split()))

price = min(a + b,b + c,a + c)
print(price)




a, b, c = map(int, input().split())



print(min(a+b, b+c, a+c))

a,b,c = map(int,input().split())

print(min(a+b,a+c,b+c))

a, b, c = map(int, input().split())

def answer(a: int, b: int, c: int) -> int:
    return min(a + b, a + c, b + c)

print(answer(a, b, c))

a,b,c = map(int,input().split())

print(min(a+b,a+c,b+c))

a, b, c = map(int, input().split())
print(min(a + b, a + c, c + b))

S_list = list(map(int,input().split()))
sum_bell=sum(S_list)
hantei = list()
for i in S_list:
    hantei.append(sum_bell - i)
print(min(hantei))

kingaku = list(map(int, input().split()))
kingaku.sort()

print((kingaku[0] + kingaku[1]))



a, b, c = map(int,input().split())

max_bell = max(a,b,c)
print(a + b + c - max_bell)

# snuke 君は自転車を買いに来ました。 snuke 君はすでに買う自転車を決めたのですが、その自転車にはベルが付いていないため、
# 自転車とは別にベルも買う必要があります。 snuke 君は安全意識が高いので、ベルをどちらの手でも鳴らせるよう、両方のハンドルに 1 つずつ 付けることにしました。
# お店にあるベルは 3 種類で、それぞれ a 円、 b 円、 c 円です。 この 3 つのうち、異なる 2 つのベルを選んで買うときの、値段の合計の最小値を求めて下さい。

a,b,c = map(int,input().split())

if a >= b and a >= c :
    print(b + c)
elif b >= a and b >= c:
    print(a + c)
elif c >= a and c >= b:
    print(a + b)

a, b, c = map(int, input().split())

plan1 = a + b
plan2 = b + c
plan3 = c + a

print(min(plan1, plan2, plan3))

l=sorted(map(int,input().split()))
print(l[0]+l[1])


# 066a

def atc_066a(abc: str) -> int:
    abc_int = [int(ai) for ai in abc.split(" ")]
    abc_int.sort()
    return abc_int[0] + abc_int[1]

abc = input()
print(atc_066a(abc))

a, b, c = list(map(int,input().split()))
bell = [a, b, c]
bell.sort()
answer = bell[0] + bell[1]
print(answer)


# A - ringring

# a b c
a, b, c = list(map(int, input().split()))
my_list = [a, b, c]
my_list.sort()
print((my_list[0] + my_list[1]))


a, b, c = map(int, input().split())
total_price = min(a+b, a+c, b+c)
print(total_price)

a,b,c = map(int,input().split())
print(min(a+b, b+c, a+c))

a, b, c = sorted([int(n) for n in input().split()])
print(a + b)

m=list(map(int,input().split()))
print(sum(m)-max(m))

def iroha():
    lists = list(map(int, input().split()))
    lists.sort()
    print((lists[0]+lists[1]))



def __starting_point():
    iroha()


__starting_point()

n=sorted(list(map(int, input().split())))
print((n[0]+n[1]))


D=list(map(int,input().split()))
D.sort()
print(D[0]+D[1])

#066A
# 1.値を正しく取得
a, b, c = (int(x) for x in input().split())

# 2.正しく処理
gokei1 = a + b
gokei2 = a + c
gokei3 = b + c

resalt=[gokei1,gokei2,gokei3]

print(min(resalt))

a, b, c = list(map(int, input().split()))
print((min(a + b, a + c, c + b)))


with open(0) as f:
    a, b, c = map(int, f.read().split())
print(a+b+c-max(a,b,c))

a, b, c = map(int, input().split())
x = a + b
y = b + c
z = c + a
if x <= y and x <= z:
  print(x)
elif y <= x and y <= z:
  print(y)
else:
  print(z)

a = list(map(int,input().split()))
print(sum(a)-max(a))

# 異なる二つの組み合わせの最小値を求める

a, b, c = list(map(int, input().split()))

vales = [a + b, a + c, b + c]

print((min(vales)))


a, b, c = map(int, input().split())
print(min(a + b, a + c, b + c))

bells = sorted(list(map(int, input().split())))
print(bells[0]+bells[1])

p = sorted(map(int, input().split()))

print(p[0]+p[1])

bell = sorted(list(map(int, input().split())))

print((bell[0] + bell[1]))

a = list(map(int, input().split()))
a.sort()
print(a[0] + a[1])

A = list(map(int, input().split()))
A = sorted(A)
print((A[0] + A[1]))


'''
ABC066 A - ringring
https://atcoder.jp/contests/abc066/tasks/abc066_a
'''
nums = list(map(int, input().split()))
ans = sum(nums) - max(nums)
print(ans)


a = list(map(int,input().split()))
print(sum(a)-max(a))

a = list(map(int, input().split()))
print(sum(a)-max(a))

a, b, c = map(int, input().split())
list01 = [a + b, b + c, a + c]
print(min(list01))

a=sorted(map(int,input().split(" ")))
print(a[0]+a[1])

a, b, c = [int(i) for i in input().split()]

print((sum([a, b, c]) - max(a, b, c)))


a,b,c = map(int,input().split())

A = a + b
B = b + c
C = c + a

print(min(A,B,C))

#ABC066
a = sorted(list(map(int,input().split())))
print(a[0]+a[1])

a = list(map(int,input().split()))
a = sorted(a)
print((a[0]+a[1]))


l = list(map(int, input().split()))

ans = sum(l) - max(l)
print(ans)


a,b,c = sorted(map(int, input().split()))

print(a + b)

a,b,c=map(int,input().split())
print(a+b+c-max(a,b,c))

with open(0) as f:
    a, b, c = map(int, f.read().split())
print(a+b+c-max(a,b,c))

a, b, c = map(int, input().split())

prices = [a + b, a + c, b + c]

print(min(prices))

a = list(map(int,input().split()))
a.sort()

print(a[0]+a[1])

a = [int(x) for x in input().split()]
print(sum(a) - max(a))

a, b, c = map(int, input().split())
print(min(a + b, b + c, a + c))

with open(0) as f:
    a, b, c = map(int, f.read().split())
print(a+b+c-max(a,b,c))

a,b,c = map(int,input().split())
print(min(a+b,b+c,a+c))

a = list(map(int,input().split()))
print(sum(a)-max(a))

a,b,c=map(int, input().split())

print(min(a+b,b+c,c+a))

a, b, c=map(int, input().split())
print(a+b+c-max(a, b, c))

price = list(map(int, input().split()))
price.sort()

print((price[0]+price[1]))


a,b,c = map(int, input().split())

kei = a + b + c

if a >= b and a >= c:
    kei -= a
    print(kei)

elif b >= a and b >= c:
    kei -= b
    print(kei)
else:
    kei -= c
    print(kei)

abc = list(map(int, input().split()))
abc.sort()
print((abc[0] + abc[1]))


a, b, c = map(int, input().split())

sums = [a + b, b + c, c + a]

print(min(sums))

# 数値の取得
p_list = list(map(int,input().split()))

# 値段の安い2つを加算し出力
p_list = sorted(p_list)
pare = p_list[0] + p_list[1]
print(pare)

bell_cost = list(map(int, input().split()))
bell_cost.sort()
minimum_cost = bell_cost[0] + bell_cost[1]
print(minimum_cost)