program main
implicit none
integer :: n
integer :: i, nc, ni
integer :: m(12)

read(*,*) n
if(n == 1) then
   write(*,'(i0)') 1
   stop
end if

do i = 1, 11
   if( i.le. 6 ) then
      m(i) = 6**i
   else
      m(i) = 9**( i-6 ) 
   end if
end do
m(12) = 1
call heapsort(12,m)

nc = 0
do while (n > 0)
   do i = 1, 11
      if (m(i) .le. n .and. m(i+1) .gt. n ) then
          n = n-m(i)
          nc = nc + 1
      end if
   end do
end do
write(*,'(i0)') nc

stop
contains
subroutine heapsort(n,array)
  implicit none
  integer,intent(in) :: n
  integer,intent(inout) :: array(1:n)
  
  integer ::i,k,j,l
  integer :: t

  l=n/2+1
  k=n
  do while(k.ne.1)
     if(l.gt.1)then
        l=l-1
        t=array(L)
     else
        t=array(k)
        array(k)=array(1)
        k=k-1
        if(k.eq.1) then
           array(1)=t
           exit
        end if
     end if
     i=l
     j=l+l
     do while(j.le.k)
        if(j.lt.k)then
           if(array(j).lt.array(j+1))j=j+1
        end if
        if (t.lt.array(j))then
           array(i)=array(j)
           i=j
           j=j+j
        else
           j=k+1
        end if
     end do
     array(i)=t
  end do
end subroutine heapsort

end program main
