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

Pulkit Gupta 2 | 130 |

Relentless | 124 |

Ibrahim Nash | 94 |

nancygarg258_pec | 90 |

darkswordsman | 90 |

Ibrahim Nash | 602 |

KartikAgarwal | 541 |

rs119574 | 371 |

surbhi_7 | 356 |

Little Noah | 335 |

akhayrutdinov | 4261 |

sanjay05 | 3633 |

Ibrahim Nash | 3162 |

Quandray | 3028 |

Michael Riegger | 2359 |