13:I[87,["736","static/chunks/89fc4f0e-9e200ae6a0166583.js","401","static/chunks/363642f4-32903b9154b7835a.js","153","static/chunks/153-58eddeb032cc4608.js","131","static/chunks/131-05ce00cfd760e12b.js","87","static/chunks/87-b76b60eef573119a.js","286","static/chunks/app/problem/%5Bid%5D/page-45cf3875257fc32e.js"],"Header"] 14:I[1742,["736","static/chunks/89fc4f0e-9e200ae6a0166583.js","401","static/chunks/363642f4-32903b9154b7835a.js","153","static/chunks/153-58eddeb032cc4608.js","131","static/chunks/131-05ce00cfd760e12b.js","87","static/chunks/87-b76b60eef573119a.js","286","static/chunks/app/problem/%5Bid%5D/page-45cf3875257fc32e.js"],"ProblemView"] 15:T75b,

When I succeed, we'll share the cakes together!

— SHUN

Simons has $$$n$$$ friends and a huge amount of cakes. To divide the cakes fairly, you are asked to help him solve the following problem:

Find the minimum positive integer $$$k$$$ such that $$$n$$$ is a divisor of $$$k^n$$$.

It can be proved that the answer always exists under the given constraints.

Input

Each test contains multiple test cases. The first line contains the number of test cases $$$t$$$ ($$$1 \le t \le 100$$$). The description of the test cases follows.

The only line of each test case contains a single integer $$$n$$$ ($$$2\le n\le 10^9$$$) — the number of friends Simons has.

Output

For each test case, output a single integer

Simons and Cakes for Success

Examples