Given an integer an **N.** The task is 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.** If there is no set bit print "0"**.

**Constraints:**

1 <= T <= 200

0 <= N <= 10^{6}

**Example:**

**Input:**

2

18

12

**Output:**

2

3

**Explanation:**

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

Author: harshitsidhwa

may55 | 86 |

ashujack | 84 |

aman19 | 82 |

abbatta7 | 75 |

lakshmi_pandey | 74 |

saumitra13325 | 648 |

ashujack | 591 |

aman19 | 562 |

lakshmi_pandey | 546 |

aroma17 | 535 |

blackshadows | 5249 |

akhayrutdinov | 5111 |

Ibrahim Nash | 5087 |

Quandray | 4354 |

sanjay05 | 3668 |

Login to report an issue on this page.