output_description: Print the minimum number of increasing integers that can represent N as their
  sum.
  
  * * *
input_description: The input is given from Standard Input in the following format:
  
      
      
      N
attempt: print("0")
  
problem_description: Statement
  
  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.
  
  Snuke has an integer N. Find the minimum number of increasing integers that
  can represent N as their sum.
samples: [{"input": "80", "output": "2\n    \n\nOne possible representation is 80 = 77 + 3.\n\n* * *"}, {"input": "123456789", "output": "1\n    \n\n123456789 in itself is increasing, and thus it can be represented as the sum\nof one increasing integer.\n\n* * *"}, {"input": "20170312", "output": "4\n    \n\n* * *"}, {"input": "7204647845201772120166980358816078279571541735614841625060678056933503", "output": "31"}]