eolymp
Competitions

Week 1 Introduction Part 1

Tuck-shop

Time limit 1 second
Memory limit 128 MiB

In the school cafeteria to the end of lessons there were some cakes: a vanilla, b chocolate and c fruit. Dima is going to buy cakes before closing the buffet. What is the maximum possible number of cakes can choose Dima?

Input data

Three non-negative integers are given - the appropriate amount of cakes, each does not exceed 20000.

Output data

Print the maximum possible number of cakes that Dima can choose.

Examples

Input example #1
4 2 3
Output example #1
9