{"raw_statement":[{"iden":"problem statement","content":"There are $N$ people numbered $1$ through $N$. Each person has a integer score called programming ability; person $i$'s programming ability is $P_i$ points. How many more points does person $1$ need, so that person $1$ becomes the strongest? In other words, what is the minimum non-negative integer $x$ such that $P_1 + x > P_i$ for all $i \\neq 1$?"},{"iden":"constraints","content":"*   $1\\leq N \\leq 100$\n*   $1\\leq P_i \\leq 100$\n*   All input values are integers."},{"iden":"input","content":"The input is given from Standard Input in the following format:\n\n$N$\n$P_1$ $P_2$ $\\dots$ $P_N$"},{"iden":"sample input 1","content":"4\n5 15 2 10"},{"iden":"sample output 1","content":"11\n\nPerson $1$ becomes the strongest when their programming skill is $16$ points or more, so the answer is $16-5=11$."},{"iden":"sample input 2","content":"4\n15 5 2 10"},{"iden":"sample output 2","content":"0\n\nPerson $1$ is already the strongest, so no more programming skill is needed."},{"iden":"sample input 3","content":"3\n100 100 100"},{"iden":"sample output 3","content":"1"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}