{"raw_statement":[{"iden":"problem statement","content":"Three non-negative integers $A$, $B$, and $C$ are written on a blackboard. You can perform the following two operations any number of times in any order.\n\n*   Subtract $1$ from two of the written integers of your choice.\n*   Subtract $1$ from all of the written integers.\n\nYour objective is to make all the numbers on the blackboard $0$. Determine whether it is achievable. If it is, find the minimum number of times you need to perform an operation to achieve it."},{"iden":"constraints","content":"*   $0 \\leq A, B, C \\leq 10^{18}$"},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$A$ $B$ $C$"},{"iden":"sample input 1","content":"2 2 3"},{"iden":"sample output 1","content":"3\n\nHere is one way to make all the numbers $0$.\n\n*   Subtract $1$ from $A$ and $C$. Now the numbers are $1$, $2$, $2$.\n*   Subtract $1$ from $B$ and $C$. Now the numbers are $1$, $1$, $1$.\n*   Subtract $1$ from all the numbers. Now the numbers are $0$, $0$, $0$."},{"iden":"sample input 2","content":"0 0 1"},{"iden":"sample output 2","content":"\\-1"},{"iden":"sample input 3","content":"0 0 0"},{"iden":"sample output 3","content":"0"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}