Given a number N, Your task is to find the length of the longest consecutive 1's in its binary representation.
The first line of input contains an integer T denoting the no of test cases. Then T test cases follow. Each test case contains an integer N.
For each test case in a new line print the length of the longest consecutive 1's in N's binary representation.