title: Given an integer N and a set of operations, reduce N to 1 in the least amount of steps
body: <p>On a given integer N we can use the following operations:</p>
  
  <ol>
  <li>If N can be divided by 3: divide by 3.</li>
  <li>If N can be divided by 2: divide by 2. </li>
  <li>Subtract 1.</li>
  </ol>
  
  <p>How can I find a strategy to reach 1 in the least number of steps?</p>