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())
  List9 = [9 ** i for i in range(6) if 9 ** i <= N]
  List6 = [6 ** i for i in range(6) if 6 ** i <= N]
  
  def recur(n,con):
    if n == 0:
      return con
      
  """
    elif n < 6:
      return con + n
      
    elif n < 9:
      return con + (n - 5)
  """    
  
    else:
      max9 = max([i for i in List9 if i <= n])
      max6 = max([i for i in List6 if i <= n])
      
      return min(recur(n - max9,con + 1),recur(n - max6,con + 1))
      
  print(recur(N,0))
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"}]