Find the Lone Set Bit

Your task is to identify the position of the only '1' bit in the binary representation of a given non-negative integer N. The representation contains exactly one '1' and the rest are '0's. If there isn't exactly one '1' in the binary representation, the function should return -1.

Input:

T : Number of test cases
N : Integer whose set bit position is to be found for each test case

Output:

Print a single integer for each test case indicating the position of the lone '1' bit, or -1 if there isn't exactly one '1'.

Example:

Input:
N = 4
Output:
3

Input:
N = 8
Output:
4

Input:
N = 9
Output:
-1

Input:
N = 0
Output:
-1

Constraints:

• 1 <= T <= 100
• 0 <= N <= 105

Note:

You do not need to print anything. Implement the function to return the correct value.