output_description: Print the smallest possible sum of the digits in the decimal notation of a
  positive multiple of K.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      K
attempt: import sys
  
  cin = sys.stdin
  # cin = open("in.txt", "r")
  
  
  def line2N():
      return map(int, cin.readline().split())
  
  
  (K,) = line2N()
  t = 0
  rMin = 0x7FFF7FFF
  for i in range(1, K + 1):
      t += K
      d = sum(map(int, str(t)))
      rMin = min(rMin, d)
  
  print(rMin)
  
problem_description: Statement
  
  Find the smallest possible sum of the digits in the decimal notation of a
  positive multiple of K.
samples: [{"input": "6", "output": "3\n    \n\n12=6\u00d72 yields the smallest sum.\n\n* * *"}, {"input": "41", "output": "5\n    \n\n11111=41\u00d7271 yields the smallest sum.\n\n* * *"}, {"input": "79992", "output": "36"}]