409807: GYM103785 B Poku's Vacation

After a gruelling semester, Poku returned to his hometown for the summer break. He wanted to spend his vacations productively, so he started applying around for internships. But alas! – he had very few options for internships in the small town of Jalna. So, he was accepted into a construction company as a brick-layer.

His first project was to construct a "staircase". A staircase consists of steps each having a height strictly greater than the previous step (the first step can be of any height). Poku has $$$N$$$ equally sized bricks, and he wants to construct a staircase with maximum number of steps to impress his mentor. He doesn't necessarily have to use all the bricks.

Help Poku calculate the maximum number of steps.

The first line of input consists of a single integer, $$$T$$$ $$$(1 \leq T \leq 10)$$$, which is the number of test cases.

The next $$$T$$$ lines of input, the $$$i^{th}$$$ of which consists of a single integer, $$$N$$$ $$$(1 \leq N \leq 10^6)$$$, which is the number of bricks that Poku would have in the $$$i^{th}$$$ case.

Print $$$T$$$ lines, the $$$i^{th}$$$ line consisting of a single integer – the maximum number of steps that Poku could construct in the $$$i^{th}$$$ case.

3
1
4
6

1
2
3