A Simple Problem

You are given a positive integer $N$. Find the smallest positive integer $K$ that is a multiple of $N^2$.

An integer $a$ is a multiple of an integer $b$ when $a = b \times k$ holds for some integer $k$.

The first line contains the number of test cases $T$.

Each of the next $T$ lines contains one integer $N$, the input of a single test case.

Constraints

• $1 \le T \le 200000$
• $1 \le N \le 200000$

For each test case, print the answer $K$ on its own line.