Minimum One Bit Operations to Make Integers Zero

Given an integer n, find the minimum number of bit-flip operations to reduce n to 0 where you can flip the 0th bit anytime, but may flip bit i only if bit i-1 = 1 and bits 0..i-2 are all 0 — a problem that requires reasoning about binary patterns/recursive (Gray-code-like) transitions.