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: # coding: utf-8
  # Your code here!
  N=int(input())
  l=[1]
  count=0
  
  def cand(num):
      i=1
      while N>=num**i:
          l.append(num**i)
          i+=1
  
  def sub(target,index):
      i=0
      if target==0:
          
      elif index==0:
          
      while target-l[index]>0:
          sub(target-l[index]**i,l[index-1])
          
  
  cand(6)
  cand(9)
  
  l.sort()
  print(l)
  
  #メモ　この方針があってるのかもわからん
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"}]