Tile Art#4124
An artist is planning a unique exhibition using square tiles. The artist wants to arrange these tiles to form rectangles of different sizes, where rectangles are considered unique if their dimensions are different (for example, 1 \times 4 and 2 \times 2 are unique rectangles, but 1 \times 4 and 4 \times 1 are the same because rotation is allowed).
For each exhibition, the artist wants to create exactly unique rectangles using a certain number of tiles. The artist wonders: what is the minimal number of square tiles required to arrange them into exactly rectangles, all with unique dimensions.
For example, if n = 2, the minimal number of tiles required is , since with tiles you can form a 1 \times 4 rectangle and a 2 \times 2 rectangle.
The input consists of a single integer indicating the number of queries, followed by a sequence of positive integers, separated by whitespace.
For each input integer , output a single line with the minimal number of unit squares that can be arranged into exactly rectangles, or Too big if the number exceeds .
Example 1