Limits 1s, 512 MB

Montu miya is a clever ant. He thinks humans are fool. Because most of the humans cut trees without any hesitation. Montu miya is smart he will not just sit back and do nothing about it. So he decided to plant trees in the field beside his house. He has a unique way to plant trees –

In the first day, he will plant only one tree. And each day after the first day he will plant double of the trees that he panted on the previous day. That means if he plant x tree on the first day, then he will plant 2x trees on the second day, 4x trees on the third day and so on.

Montu miya also wants to organize a seminar on “importance of tree plantation” in the empty section of the field after planting exactly half of the trees.

He knows it will take exactly n days to fill the field with trees. But now he wants to know on which day he will finish planting half of the trees.

Input

First line of in input contain an integer T , (1<=T<=1000000) , number of testcase. Then every T line will contain an integer n , (2<=n<=20000) , number of days it will take to fill the field with trees.

Output

Output will contain T lines, each line will be the number of days it will take to plant half of the trees.

Sample

InputOutput
1
2
1

Submit

Login to submit.

Statistics

85% Solution Ratio
joyislam1954Earliest, Oct '18
Nusab19Fastest, 0.0s
ItzRAYLightest, 4.9 MB
Nusab19Shortest, 57B
Toph uses cookies. By continuing you agree to our Cookie Policy.