Yennefer is casting a spell to trap a Griffin. In this trap, she makes a pattern of nested squares on the ground. She first starts with making a square of side 1 and in each of next step, she adds one square with length of sides one more than previous one. However, she can only make squares having strength lesser than or equal to s. Strength of a square is equal to the 3rd power of it's side, ie, $side^3$. So, Yennefer has asked you to tell her that how many squares she can add on the field.

Input Format--

First line contains t, number of test cases.

Each of the next t lines contains one integer, s, maximum strength possible.

Output Format--

For each test case, output the calculated answer in separate lines.

Constraints--

$1 \leq t \leq 10^6$

$1 \leq s \leq 10^{18}$