Problem:
Score : 300 points

Problem 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.

Constraints

1 \leq N \leq 100000

N is an integer.

Input

Input is given from Standard Input in the following format:

N

Output

If at least x operations are required to withdraw exactly N yen in total, print x.

Sample Input 1

127

Sample Output 1

4

By withdrawing 1 yen, 9 yen, 36(=6^2) yen and 81(=9^2) yen, we can withdraw 127 yen in four operations.

Sample Input 2

3

Sample Output 2

3

By withdrawing 1 yen three times, we can withdraw 3 yen in three operations.

Sample Input 3

44852

Sample Output 3

16

Solution in Rust (1.15.1) (judge verdict: Wrong Answer)

use std::io::*;
use std::str::FromStr;

pub fn read<T: FromStr>() -> T {
    let stdin = stdin();
    let stdin = stdin.lock();
    let token: String = stdin
        .bytes()
        .map(|c| c.expect("failed to read char") as char)
        .skip_while(|c| c.is_whitespace())
        .take_while(|c| !c.is_whitespace())
        .collect();
    token.parse().ok().expect("failed to parse token")
}

fn main() {
    let mut n: i64 = read();
    let mut x: Vec<i64> = vec![0; 100_001];

    let mut tmp_six = 6;
    while tmp_six < 100_000 {
        x[tmp_six] = tmp_six as i64;
        tmp_six *= 6;
    }

    let mut tmp_nine = 9;
    while tmp_nine < 100_000 {
        x[tmp_nine] = tmp_nine as i64;
        tmp_nine *= 9;
    }

    let mut head = 1;
    for i in 0..x.len() {
        if x[i] == 0 {
            x[i] = head;
        } else {
            head = x[i];
        }
    }

    let mut cnt = 0;
    while n != 0 {
        n -= x[n as usize];
        cnt += 1;
    }
    println!("{}", cnt);
}