You start with 0 and you have to Find the minimum number of operations to reach 'n'. In one operation you can add or subtract any 2^k to your current number. Where k can be any positive integer.
test cases <200,000;
1 <= | n | <= 1,000,000,000 . Example:
First line is no. of test cases, then a single integer 'n' on each line.
Can anybody help??