|All-time Popular Problems|
|Maximum difference between node and its ancestor|
|Count nodes of linked list|
|Find first set bit|
|Angle between hour and minute hand|
|Recursively remove all adjacent duplicates|
|Remove every k'th node|
|Merge Two Sorted Arrays|
|Spirally traversing a matrix|
|Merge two sorted linked lists|
|Longest Increasing Subsequence|
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.
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.
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.If there is no set bit print "0".
Test case 1:
Binary representation of the 18 is 010010, the first set bit from the right side is at position 2.