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.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:**

Test case 1:

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

surya jeet singh | 251 |

tech_devil | 188 |

mvsaichaitanya | 168 |

Baki | 154 |

shubham001 | 149 |

Anurag_Singh | 711 |

satyam singh 9 | 577 |

Mandir-wahi-banega | 546 |

surya jeet singh | 506 |

Aman Patel | 486 |

akhayrutdinov | 4777 |

Quandray | 4050 |

sanjay05 | 3668 |

Ibrahim Nash | 3664 |

surbhi_7 | 2816 |