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: wt = int(input())
  w = [1]
  for i in range(7):
      w.append(6 ** (i + 1))
  for i in range(5):
      w.append(9 ** (i + 1))
  n = len(w)
  dp = [[float("inf") for i in range(wt + 1)] for j in range(n + 1)]
  dp[0][0] = 0
  for i in range(n):
      for j in range(wt + 1):
          if j >= w[i]:
              dp[i + 1][j] = min(dp[i + 1][j - w[i]] + 1, dp[i][j])
          else:
              dp[i + 1][j] = dp[i][j]
  print(dp[n][wt])
  
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"}]