Bovine Bones

Bessie loves board games and role-playing games so she persuaded
Farmer John to drive her to the hobby shop where she purchased three
dice for rolling. These fair dice have S1, S2, and S3 sides
respectively (2 <= S1 <= 20; 2 <= S2 <= 20; 2 <= S3 <= 40).

Bessie rolls and rolls and rolls trying to figure out which three-dice
sum appears most often.

Given the number of sides on each of the three dice, determine which
three-dice sum appears most frequently. If more than one sum can
appear most frequently, report the smallest such sum.

PROBLEM NAME: bones.X

INPUT FORMAT:

* Line 1: Three space-separated integers: S1, S2, and S3

SAMPLE INPUT:

3 2 3

OUTPUT FORMAT:

* Line 1: The smallest integer sum that appears most frequently when
        the dice are rolled in every possible combination.

SAMPLE OUTPUT:

5

OUTPUT DETAILS:

Here are all the possible outcomes.
1 1 1 -> 3  1 2 1 -> 4  2 1 1 -> 4  2 2 1 -> 5  3 1 1 -> 5  3 2 1 -> 6
1 1 2 -> 4  1 2 2 -> 5  2 1 2 -> 5  2 2 2 -> 6  3 1 2 -> 6  3 2 2 -> 7
1 1 3 -> 5  1 2 3 -> 6  2 1 3 -> 6  2 2 3 -> 7  3 1 3 -> 7  3 2 3 -> 8

Both 5 and 6 appear most frequently (five times each), so 5 is the answer.