Problem Statement  
There is nothing more beautiful than just an integer number. You start with the integer 1 and you apply a sequence of operations until you reach the integer n. Each operation can be one of the following:
Return the minimum possible number of operations required to reach n.  
Definition  
 
Constraints  
  n will be between 1 and 10^18, inclusive.  
Examples  
0)  
 
1)  
 
2)  
 
3)  
