Find the least number of operations: Add one and Multiply two
1. Interesting trick with binary expansions
int leastOperation(int n){
    int count = 0;
    while(n > 0){
        if(n % 2 == 0){
            n /=2;
        }
        else{
            n--;
        }
        count++;
    }
    return count;
}