A13993 | $Different Divisors$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

Positive integer $x$ is called divisor of positive integer $y$ , if $y$ is divisible by $x$ without remainder. For example, $1$ is a divisor of $7$ and $3$ is not divisor of $8$ . We gave you an integer $d$ and asked you to find the smallest positive integer $a$ , such that - $a$ has at least $4$ divisors; - difference between any two divisors of $a$ is at least $d$ .

The first line contains a single integer $t$ ( $1 \leq t \leq 3000$ ) — the number of test cases. The first line of each test case contains a single integer $d$ ( $1 \leq d \leq 10000$ ).

For each test case print one integer $a$ — the answer for this test case.

输入 #1

2
1
2

输出 #1

6
15

C++ 编辑器

输入

输出