The Tortoise challenged Achilles to a race, claiming that he would win as long as Achilles gave him a small head start. Achilles laughed at this, for of course, he was a mighty warrior and swift of foot, whereas the Tortoise was heavy and slow.

Achilles allows the tortoise a head start of 1 meter. Supposing that each racer starts running at some constant speed, one faster than the other. After some finite time, Achilles will have run 1 meter, bringing him to the tortoise's starting point. During this time, the tortoise has run a much shorter distance, say 0.5 meters. It will then take Achilles some further time to run that distance, by which time the tortoise will have advanced farther 0.25 meters. Thus, whenever Achilles arrives somewhere the tortoise has been, he still has to cover half distance of what he already covered to go before he can even reach the tortoise.

You have to find how much distance is left between Achilles and Tortoise at N^th second.

Input

• The first line of the input contains a single integer T denoting the number of test cases. The description of T test cases follows.
• The first line of each Test Case, contains a single integer N, the distance left after that second.

Output

For each test case, print a single line integer, the distance left between Achilles and Tortoise. The answer can be up to 1340 decimal places.

Constraints 

$1\leq T \leq 10^{4} \\ 1\leq N \leq 1337$