Please solve the programming task below using a self-contained code snippet in a markdown code block.

Given an integer n, you must transform it into 0 using the following operations any number of times:

Change the rightmost (0th) bit in the binary representation of n.
Change the ith bit in the binary representation of n if the (i-1)th bit is set to 1 and the (i-2)th through 0th bits are set to 0.

Return the minimum number of operations to transform n into 0.
 
Please complete the following python code precisely:
```python
class Solution:
    def minimumOneBitOperations(self, n: int) -> int:
```