All Tracks Basic Programming Bit Manipulation Basics of Bit Manipulation Problem

Lazy Panda
Tag(s):

Easy

Problem
Editorial
Analytics

It is winter time and the cold breezes make coder panda feel sleepy all the day. As he is fond of solving questions, he decided to utilize these vacations. He makes a plan of solving questions in following manner:-

On first day he decides to solve 1 question , then with each passing day , number of questions will get doubled  (i.e on second day 2 questions, on third day 4 questions, on fourth day 8 questions and so on). But on some days, due to his laziness he just sleeps all the day and doesn't practice a single question  .

Now you are given an integer N denoting the total number of questions Lazy Panda solved in the vacation . Determine the number of days Lazy Panda was active. An active day means solving all the questions of that particular day.

Input

First line will contain a single integer T determining number of test cases.

The only line in each test cases will consist of single integer N determining number of questions done by Lazy Panda.

Output

Print number of days Lazy Panda was active for each test case in a new line.

Constraints

1<=T<=100000

1<=N<=10^18

 

 

SAMPLE INPUT
2
10 
18
SAMPLE OUTPUT
2
2
Explanation

For 1st test case, Lazy Panda was active on DAY 4 (8 questions) and DAY 2 (2 questions). 

Time Limit: 1.0 sec(s) for each input file.
Memory Limit: 256 MB
Source Limit: 1024 KB
Marking Scheme: Marks are awarded when all the testcases pass.
Allowed Languages: Bash, C, C++, C++14, Clojure, C#, D, Erlang, F#, Go, Groovy, Haskell, Java, Java 8, JavaScript(Rhino), JavaScript(Node.js), Julia, Kotlin, Lisp, Lisp (SBCL), Lua, Objective-C, OCaml, Octave, Pascal, Perl, PHP, Python, Python 3, R(RScript), Racket, Ruby, Rust, Scala, Swift, Swift-4.1, TypeScript, Visual Basic

CODE EDITOR

Initializing Code Editor...
Your Rating:

Contributor

通知
View All Notifications

?