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: s = input()
  a = int(s)
  list = []
  list.append(1)
  list.append(6)
  list.append(9)
  list.append(36)
  list.append(81)
  list.append(216)
  list.append(729)
  list.append(1296)
  list.append(6561)
  list.append(7776)
  list.append(46656)
  list.append(59049)
  pp = []
  
  
  def money(x, y):
      for i in range(12):
          if 0 <= x // list[i] < 6:
              if x % list[i] == 0:
                  pp.append(y + x // list[i])
                  break
              else:
                  money(x - list[i], y + 1)
  
  
  money(a, 0)
  print(min(pp))
  
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"}]