**Compilation/Execution Result:**

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<=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.

surbhi_7 | 116 |

John Carey | 92 |

Rajat Thakur 2 | 85 |

shaktiman_shaktiman_shaktiman | 81 |

mystery | 80 |

Ibrahim Nash | 592 |

ashrepos | 490 |

RealHorror | 364 |

shaktiman_shaktiman_shaktiman | 353 |

shi143din | 340 |

akhayrutdinov | 4052 |

sanjay05 | 3406 |

Quandray | 2427 |

Michael Riegger | 2228 |

Jasleen Kaur 2 | 2012 |