Connecting Square Tiles

Given $N$ square tiles, all with the same shape and size, each with side length $1$. There is a floor covered with a grid of unit squares. Join the tiles on this floor to form a single figure.

Tiles can only be placed on the cells of the grid, and tiles cannot overlap or be stacked. All tiles must be connected to each other.

Given the number of square tiles, find the minimum possible perimeter of a figure that can be formed by joining them according to the rules above. You must solve $T$ test cases in one input.

The first line contains the number of test cases $T$. ($1\leq T\leq 100\,000$)

Each of the next $T$ lines contains the number of tiles $N$ for one test case. ($1\leq N\leq 10^9$)

The input data can be large, so keep this in mind.

For each test case, in the order given, print the minimum possible perimeter on its own line.

This is a problem where the same task is solved many times within one input. To be accepted, the program must print correct answers for every test case in the input within the time limit, then exit.