SP18660 FACTMULN - Product of factorials (easy)

For n positive integer, let **_F(n) = 1! × 2! × 3! × 4! × ... × n!_**, product of factorial(i) for i in \[1..n\]. Let **_G(n) = {i in \[1..n\], such that n divides F(i)}_**. It is obvious that **_n_** belongs to **_G(n)_** that makes it a non empty set.

The first line of input contains an integer **_T_**, the number of test cases. On each of the next **_T_** lines, your are given an integer **_n_**.

For each test case, you have to print **_min(G(n))_**.