Assi loves to wear clean clothes and his favorite detergent is "Nirma". One day he decided to wash some of his clothes in a triangular basin. While washing his dirty laundry he started wondering : If he had three sticks what would be the largest triangle he can come up with. He might need to chop some of the wood. Largest in the sense that the total sum of the sides must be maximum.

Given the length of three woods return the total length of the sides of the largest possible valid triangle. You may chop one or all woods.

Constraints:

Input

One line which contains three integers A,B and C ( 1<= A,B,C <= 100000 ) .

Output

The maximum total side length .