Problem Description

Our lovely KK has a difficult mathematical problem:he has a $N\left( 1\leq N\leq {10}^{18}\right)$ meters steel,he will cut it into steels as many as possible,and he doesn't want any two of them be the same length or any three of them can form a triangle.

Input

The first line of the input file contains an integer $T\left( 1\leq T\leq 10\right)$, which indicates the number of test cases.

Each test case contains one line including a integer $N\left( 1\leq N\leq {10}^{18}\right)$,indicating the length of the steel.

Output

For each test case, output one line, an integer represent the maxiumum number of steels he can cut it into.

1
6

3

Hint

1+2+3=6 but 1+2=3 They are all different and cannot make a triangle.