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: N = int(input())
  cnt = 0
  i = 10
  dp = [0, 1, 2, 3, 4, 5, 1, 2, 3, 1]
  while i <= N:
      idx_n, idx_s = 0, 0
      while i - (9**idx_n) >= 0:
          idx_n += 1
      idx_n -= 1
      while i - (6**idx_s) >= 0:
          idx_s += 1
      idx_s -= 1
      dp.append(min(1 + dp[i - (9**idx_n)], 1 + dp[i - (6**idx_s)]))
      i += 1
  print(dp[N])
  
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"}]