{"trustable":false,"prependHtml":"\u003cstyle type\u003d\u0027text/css\u0027\u003e\n .input, .output {\n border: 1px solid #888888;\n }\n .output {\n margin-bottom: 1em;\n position: relative;\n top: -1px;\n }\n .output pre, .input pre {\n background-color: #EFEFEF;\n line-height: 1.25em;\n margin: 0;\n padding: 0.25em;\n }\n \u003c/style\u003e\n \u003clink rel\u003d\"stylesheet\" href\u003d\"//codeforces.org/s/96598/css/problem-statement.css\" type\u003d\"text/css\" /\u003e\u003cscript\u003e window.katexOptions \u003d { disable: true }; \u003c/script\u003e\n\u003cscript type\u003d\"text/x-mathjax-config\"\u003e\n MathJax.Hub.Config({\n tex2jax: {\n inlineMath: [[\u0027$$$\u0027,\u0027$$$\u0027], [\u0027$\u0027,\u0027$\u0027]],\n displayMath: [[\u0027$$$$$$\u0027,\u0027$$$$$$\u0027], [\u0027$$\u0027,\u0027$$\u0027]]\n }\n });\n\u003c/script\u003e\n\u003cscript type\u003d\"text/javascript\" async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS_HTML-full\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"HTML","content":"\u003cp\u003ePositive integer $$$x$$$ is called \u003cspan class\u003d\"tex-font-style-it\"\u003edivisor\u003c/span\u003e 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$$$.\u003c/p\u003e\u003cp\u003eWe gave you an integer $$$d$$$ and asked you to find \u003cspan class\u003d\"tex-font-style-bf\"\u003ethe smallest\u003c/span\u003e positive integer $$$a$$$, such that \u003c/p\u003e\u003cul\u003e\u003cli\u003e $$$a$$$ has at least $$$4$$$ divisors; \u003c/li\u003e\u003cli\u003e difference between any two divisors of $$$a$$$ is at least $$$d$$$.\u003c/li\u003e\u003c/ul\u003e如果 y\n 能被 x\n 整除而没有余数,则正整数 x\n 称为正整数 y\n 的被除数。例如, 1\n 是 7\n 的整除数,而 3\n 不是 8\n 的整除数。\u003c/p\u003e\n\n我们给你一个整数 d\n ,要求你找出最小的正整数 a\n ,使得:\u003c/p\u003e\n\na\n 至少有 4\n 个除数;\u003c/p\u003e\na\n 的任意两个除数之差至少为 d\n 。"}},{"title":"Input","value":{"format":"HTML","content":"\u003cp\u003eThe first line contains a single integer $$$t$$$ ($$$1 \\leq t \\leq 3000$$$)\u0026nbsp;— the number of test cases.\u003c/p\u003e\u003cp\u003eThe first line of each test case contains a single integer $$$d$$$ ($$$1 \\leq d \\leq 10000$$$).\u003c/p\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cp\u003eFor each test case print one integer $$$a$$$\u0026nbsp;— the answer for this test case.\u003c/p\u003e"}},{"title":"Sample 1","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e2\n1\n2\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e6\n15\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}},{"title":"Note","value":{"format":"HTML","content":"\u003cp\u003eIn the first test case, integer $$$6$$$ have following divisors: $$$[1, 2, 3, 6]$$$. There are $$$4$$$ of them and the difference between any two of them is at least $$$1$$$. There is no smaller integer with at least $$$4$$$ divisors.\u003c/p\u003e\u003cp\u003eIn the second test case, integer $$$15$$$ have following divisors: $$$[1, 3, 5, 15]$$$. There are $$$4$$$ of them and the difference between any two of them is at least $$$2$$$.\u003c/p\u003e\u003cp\u003eThe answer $$$12$$$ is INVALID because divisors are $$$[1, 2, 3, 4, 6, 12]$$$. And the difference between, for example, divisors $$$2$$$ and $$$3$$$ is less than $$$d\u003d2$$$.\u003c/p\u003e在第一个测试案例中,整数 6\n 有以下除数: [1,2,3,6]\n .有 4\n 个整数,其中任意两个整数之差至少为 1\n 。没有一个较小的整数至少有 4\n 个除数。\u003c/p\u003e\n\n在第二个测试案例中,整数 15\n 有以下除数: [1,3,5,15]\n .有 4\n 个除数,且任意两个除数之差至少为 2\n 。\u003c/p\u003e\n\n答案 12\n 是无效的,因为除数是 [1,2,3,4,6,12]\n 。例如,除数 2\n 和 3\n 之间的差小于 d\u003d2\n 。"}}]}