Given a positive integer n, you may repeatedly perform the following operation any number of times.

In one operation, choose a nonnegative integer i and either add $2^i$ to n or subtract $2^i$ from n.

Return the minimum number of operations required to make n equal to $0$.

Constraints:

• $1 \leq$ n $\leq 10^5$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.