题目描述
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.
Examples
Input
700 600 780
Output
1300
Input
10000 10000 10000
Output
20000
输入格式
见题面
输出格式
见题面
样例输入
10000 10000 10000
样例输出
20000