import java.util.concurrent.LinkedBlockingDeque
import kotlin.math.min

fun main() {
    val n = readLine()?.toInt() ?: return
    val r = n
    var c = Int.MAX_VALUE

    fun sub(v: Int): Pair<Int, Int> {
        var six = 6
        if (six > v) {
            six = -1
        } else {
            while (true) {
                if (six == v) {
                    break
                }
                val newSix = six * 6
                if (newSix > v) {
                    break
                }
                six = newSix
            }
        }
        var nine = 9
        if (nine > v) {
            nine = -1
        } else {
            while (true) {
                if (nine == v) {
                    break
                }
                val newNine = nine * 9
                if (newNine > v) {
                    break
                }
                nine = newNine
            }
        }
        return Pair(six, nine)
    }

    val f = sub(r)
    val queue = LinkedBlockingDeque<List<Int>>()
    if (f.first != -1) {
        queue.offer(listOf(f.first))
    } else {
        c = min(c, r)
    }
    if (f.second != -1) {
        queue.offer(listOf(f.second))
    } else {
        c = min(c, r)
    }

    while (queue.isNotEmpty()) {
        val q = queue.poll()
        val s = q.sum()
        val next = sub(r - s)
        if (next.first == -1) {
            c = min(
                c, q.size + if (s == r) 0 else {
                    r - s
                }
            )
        } else {
            queue.offer(q + listOf(next.first))
        }
        if (next.second == -1) {
            c = min(
                c, q.size + if (s == r) 0 else {
                    r - s
                }
            )
        } else {
            queue.offer(q + listOf(next.second))
        }
    }
    println(c.toString())
}