BETA

Difficulty Level: Basic

Submissions: 8083 Accuracy:

30.36%

Find first set bit
     

Given an integer an N, write a program to print the position of first set bit found from right side in the binary representation of the number.

Input:
The first line of the input contains an integer T, denoting the number of test cases. Then T test cases follow. The only line of the each test case contains an integer N.

Output:
For each test case print in a single line an integer denoting the position of the first set bit found form right side of the binary representation of the number.

Constraints:
1<=T<=200

0<=N<=106

Example:

Input:
2

18
12

Output:
2

3

Explanation:
Test case 1:

Binary representation of the 18 is 010010, the first set bit from the right side is at position 2.

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

Author: Harshit Sidhwa

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.