BETA

Difficulty Level: Basic

Submissions: 3656 Accuracy:

45.54%

Find position of set bit
     

Given a number having only one ‘1’ and all other ’0’s in its binary representation, find position of the only set bit. If there is only one '1' bit then print that position else print -1. Position of  set bit '1' should be counted starting with 1 from LSB side in binary representation of the number.

Input:

The first line of input contains an integer T denoting the number of test cases.
The first line of each test case is N.

Output:

Print the position if there is only one '1' bit, else print -1. For each test case print the output in a new line.

Constraints:

1 ≤ T ≤ 100
1 ≤ N ≤ 100000000

Example:

Input
2
2
5

Output
2
-1

 

** For More Input/Output Examples Use 'Expected Output' option **

Set Default Code

					   
It is recommended to 'Compile & Test' your code before clicking 'Submit'!

Compilation/Execution Result:

Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.