Mr. B, Mr. G, Mr. M and their coach Professor S are planning their way to Warsaw for the ACM-ICPC World Finals. Each of the four has a square-shaped suitcase with side length \textbf{A_i} (\textbf{1} ≤ \textbf{i} ≤ \textbf{4}) respectively. They want to pack their suitcases into a large square box. The heights of the large box as well as the four suitcases are exactly the same. So they only need to consider the large box’s side length. Of course, you should write a program to output the minimum side length of the large box, so that the four suitcases can be put into the box without overlapping. \InputFile Each test case contains only one line containing \textbf{4} integers \textbf{A_i} (\textbf{1} ≤ \textbf{i} ≤ \textbf{4}, \textbf{1} ≤ \textbf{A_i} ≤ \textbf{1000000000}) indicating the side length of each suitcase. \OutputFile For each test case, display a single line containing the case number and the minimum side length of the large box required. \Note For the first case, all suitcases have size \textbf{2}×\textbf{2}. So they can perfectly be packed in a \textbf{4}×\textbf{4} large box without wasting any space. For the second case, three suitcases have size \textbf{2}×\textbf{2} and the last one is \textbf{1}×\textbf{1}. No matter how you rotate or move the suitcases, the side length of the large box must be at least \textbf{4}.