You cannot submit for this problem because the contest is ended. You can click "Open in Problem Set" to view this problem in normal mode.

Description

Bessie loves playing Board Role-Playing Games (BRPG), so she convinced Farmer John to drive her to the store where she bought three dice.
These three dice have $S_1$, $S_2$, and $S_3$ faces respectively. Each die with $S$ faces has numbers from $1$ to $S$ on its faces.
Bessie throws all three dice at once, and she keeps throwing them to find out which sum of the three dice appears most frequently.
Given the number of faces on each of the three dice, determine which sum appears most frequently. If there are multiple solutions, output the smallest one.
Data range: ($2 \le S_1 \le 20$; $2 \le S_2 \le 20$; $2 \le S_3 \le 40$).

Input Format

First line: Three positive integers $S_1$, $S_2$, $S_3$.

Output Format

A single integer representing the most frequently occurring sum.

Sample

3 2 3

5