{"raw_statement":[{"iden":"problem statement","content":"We will call a non-negative integer _increasing_ if, for any two adjacent digits in its decimal representation, the digit to the right is greater than or equal to the digit to the left. For example, $1558$, $11$, $3$ and $0$ are all increasing; $10$ and $20170312$ are not.\nSnuke has an integer $N$. Find the minimum number of increasing integers that can represent $N$ as their sum."},{"iden":"constraints","content":"*   $1 \\leq N \\leq 10^{500000}$"},{"iden":"input","content":"The input is given from Standard Input in the following format:\n\n$N$"},{"iden":"sample input 1","content":"80"},{"iden":"sample output 1","content":"2\n\nOne possible representation is $80 = 77 + 3$."},{"iden":"sample input 2","content":"123456789"},{"iden":"sample output 2","content":"1\n\n$123456789$ in itself is increasing, and thus it can be represented as the sum of one increasing integer."},{"iden":"sample input 3","content":"20170312"},{"iden":"sample output 3","content":"4"},{"iden":"sample input 4","content":"7204647845201772120166980358816078279571541735614841625060678056933503"},{"iden":"sample output 4","content":"31"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}