Coffin Tiles

Square tiles are arranged into rectangles to decorate a lid. A set of $k$ identical square tiles can be laid out as an $a \times b$ rectangle whenever $a \times b = k$. Two rectangles count as the same shape when they share the same pair of side lengths, so $a \times b$ and $b \times a$ are not distinct. The number of dimensionally-unique rectangles that $k$ tiles can form is therefore the number of unordered factor pairs of $k$.

For each given positive integer $n$, output the minimal number of tiles that can be arranged into exactly $n$ dimensionally-unique rectangles. For example, for $n = 2$ the answer is $4$: with $4$ tiles you can build a $1 \times 4$ rectangle and a $2 \times 2$ rectangle, and no smaller number of tiles yields exactly two rectangles.

If the minimal number of tiles needed is greater than $1{,}000{,}000$, output Too big instead.

The first integer is $T$, the number of queries to read. It is followed by $T$ positive integers $n$, separated by whitespace (the values may span one or more lines).

For each integer $n$, print on its own line the minimal number of unit squares that can be arranged into exactly $n$ dimensionally-unique rectangles, or Too big if that number is greater than $1{,}000{,}000$.