Three Sticks

Yeongseon has three sticks of lengths $a$, $b$, and $c$, and she can shorten each stick to any length she likes.

She wants to build a triangle out of the three sticks so that all of the following hold.

• The length of each stick is a positive integer.
• The three sticks form a triangle of positive area.
• The perimeter of the triangle is as large as possible.

Given $a$, $b$, and $c$, write a program that finds the largest perimeter she can build.

The first line contains three integers $a$, $b$, $c$. ($1 \le a, b, c \le 100$)

Print the largest perimeter of a triangle that can be built.