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. Constraints: test cases <200,000; 1 <= | n | <= 1,000,000,000 .

Example: INPUT: 5 1 2 0 6 10 OUTPUT: 1 1 0 2 2 Can anybody help??