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::cmp::min;
fn read<T: std::str::FromStr>() -> T {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).ok();
    s.trim().parse().ok().unwrap()
}

fn read_vec<T: std::str::FromStr>() -> Vec<T> {
    read::<String>()
        .split_whitespace()
        .map(|e| e.parse().ok().unwrap())
        .collect()
}

fn read_vec2<T: std::str::FromStr>(n: u32) -> Vec<Vec<T>> {
    (0..n).map(|_| read_vec()).collect()
}
fn main(){
    let ans =solve();
    println!("{}",ans);
}

fn solve()->i32{
    let  d = read::<i32>();
    let mut ans = 0;
    let mut sub = d;
    let mut v = Vec::new();
    let mut vsix = fact6(d);
    let mut  vnine = fact9(d);
    v.append(&mut vsix);
    v.append(&mut vnine);
    v.push(1);
    v.sort();
    v.reverse();
    while sub !=0 {
        for j in &v{
            if sub >= *j{
                sub = sub - j;
                ans = ans + 1;
                break;
            }
        }
    }
    ans
}

fn fact6(x:i32) ->Vec<i32>{
    let mut count = 1;
    let mut res = 0;
    let mut v =Vec::new();
    while res < x{
        res = calc6(count);
        v.push(res);
        count = count+1;
    }
    v.pop();
    v
}
fn fact9(x:i32) ->Vec<i32>{
    let mut count = 1;
    let mut res = 0;
    let mut v =Vec::new();
    while res < x{
        res = calc9(count);
        v.push(res);
        count = count+1;
    }
    v.pop();
    v
}
fn calc6(x:i32) -> i32{
    let mut ans = 1;
    for _ in 0..x{
        ans = ans* 6
    }
    ans
}
fn calc9(x:i32) -> i32{
    let mut ans = 1;
    for _ in 0..x{
        ans = ans* 9
    }
    ans
}