Mrs. S is very intelligent and very curious to learn new things. She was learning few Bit-algorithms but stuck somewhere and wants your help. The task is to count the set-bits and non set-bits of an integer N. Help her doing the same.
First line consists of T testcases. Only line of every testcase consists of an integer N.
For each testcase in new line, print the count of set-bits and non set-bits separated by space.
1 <= T <= 100
1 <= N <=1018
Testcase 1: Binary representation of the given number 8 is: 1 0 0 0. In this representation number of set-bits and non set-bits is 1 and 3.
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.