title: minimum number of steps from 1 -> n with two operations
body: <p>Given a number <em>n</em>, find the minimum number of steps to get from 1 to <em>n</em> using only 2 operations: </p>
  
  <ol>
  <li>Multiply by 2</li>
  <li>Divide by 3</li>
  </ol>
  
  <p>Is this possible to get to any <em>n</em> using only these two operations?</p>