CF1748A.The Ultimate Square

传统题 时间 2000 ms 内存 256 MiB 3 尝试 1 已通过 1 标签

The Ultimate Square

You have nn rectangular wooden blocks, which are numbered from 11 to nn. The ii-th block is 11 unit high and i2\lceil \frac{i}{2} \rceil units long.

Here, x2\lceil \frac{x}{2} \rceil denotes the result of division of xx by 22, rounded up. For example, 42=2\lceil \frac{4}{2} \rceil = 2 and 52=2.5=3\lceil \frac{5}{2} \rceil = \lceil 2.5 \rceil = 3.

For example, if n=5n=5, then the blocks have the following sizes: 1×11 \times 1, 1×11 \times 1, 1×21 \times 2, 1×21 \times 2, 1×31 \times 3.

The available blocks for n=5n=5

Find the maximum possible side length of a square you can create using these blocks, without rotating any of them. Note that you don't have to use all of the blocks.

One of the ways to create 3×33 \times 3 square using blocks 11 through 55

Input

Each test contains multiple test cases. The first line contains a single integer tt (1t1041 \le t \le 10^4) — the number of test cases.

The first line of each test case contains a single integer nn (1n1091 \le n \le 10^9) — the number of blocks.

Output

For each test case, print one integer — the maximum possible side length of a square you can create.

Note

In the first test case, you can create a 1×11 \times 1 square using only one of the blocks.

In the second test case, one of the possible ways to create a 3×33 \times 3 square is shown in the statement. It is impossible to create a 4×44 \times 4 or larger square, so the answer is 33.

Samples

3
2
5
197654321
1
3
98827161

在线编程 IDE

建议全屏模式获得最佳体验