output_description: If at least x operations are required to withdraw exactly N yen in total,
  print x.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
attempt: x = int(input())
  count = 0
  if x >= 9**5:
      x -= 9**5
      count += 1
  for i in range(6, 1, -1):
      if x >= 9**i:
          while x >= 9**i:
              x -= 9**i
              count += 1
      if x >= 6**i:
          while x >= 6**i:
              x -= 6**i
              count += 1
  a = x
  p = x
  for i in range(x):
      for j in range(x):
          for l in range(x):
              if 9 * i + 6 * j + 1 * l == 23:
                  b = i + j + l
                  p = min(p, b)
  print(count + p)
  
problem_description: Statement
  
  To make it difficult to withdraw money, a certain bank allows its customers to
  withdraw only one of the following amounts in one operation:
  
    * 1 yen (the currency of Japan)
  
    * 6 yen, 6^2(=36) yen, 6^3(=216) yen, ...
  
    * 9 yen, 9^2(=81) yen, 9^3(=729) yen, ...
  
  At least how many operations are required to withdraw exactly N yen in total?
  
  It is not allowed to re-deposit the money you withdrew.
samples: [{"input": "127", "output": "4\n    \n\nBy withdrawing 1 yen, 9 yen, 36(=6^2) yen and 81(=9^2) yen, we can withdraw\n127 yen in four operations.\n\n* * *"}, {"input": "3", "output": "3\n    \n\nBy withdrawing 1 yen three times, we can withdraw 3 yen in three operations.\n\n* * *"}, {"input": "44852", "output": "16"}]