Positive integer x is called divisor of positive integer y, in case y is distinguishable by x without remaining portion. For instance, 1 is a divisor of 7 and 3 isn't divisor of 8. We gave you an integer d and requested that you track down the littlest positive integer a, to such an extent that a has no less than 4 divisors
Correct answer will be upvoted else downvoted. Computer science.
Positive integer x is called divisor of positive integer y, in case y is distinguishable by x without remaining portion. For instance, 1 is a divisor of 7 and 3 isn't divisor of 8.
We gave you an integer d and requested that you track down the littlest positive integer a, to such an extent that
a has no less than 4 divisors;
contrast between any two divisors of an is essentially d.
Input
The primary line contains a solitary integer t (1≤t≤3000) — the number of experiments.
The primary line of each experiment contains a solitary integer d (1≤d≤10000).
Output
For each experiment print one integer a — the response for this experiment.
Step by step
Solved in 4 steps with 1 images
