{"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\u003e 我们定义由n个整数组成的序列a1,a2,...,an是饥饿序列,当且仅当:\u003c/p\u003e \n\u003cp\u003e 1、它的元素是以递增的顺序,即对于任何两个下标i,j(i \u0026lt;j)满足不等式ai \u0026lt;aj。\u003c/p\u003e \n\u003cp\u003e \u003cspan\u003e\u003cspan\u003e2、对于任何两个下标i和j(i\u003c/span\u003e\u003c/span\u003e \u0026lt;j),aj不能被ai整除。\u003c/p\u003e \n\u003cp\u003e \u003cspan\u003e\u003cspan\u003e请你找到包含n个元素的饥饿序列。\u003c/span\u003e\u003c/span\u003e\u003c/p\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cdiv\u003e \n \u003cdiv\u003e \n \u003cp\u003e \u003cspan\u003e\u003cspan\u003e只有一个单独的整数n(1\u003c/span\u003e\u003c/span\u003e ≤ \u003cem\u003en\u003c/em\u003e ≤ \u003cspan\u003e\u003cspan\u003e10\u003csup\u003e5\u003c/sup\u003e)\u003c/span\u003e\u003c/span\u003e\u003c/p\u003e \n \u003c/div\u003e \n\u003c/div\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cdiv\u003e \n \u003cdiv\u003e \n \u003cp\u003e \u003cspan\u003e\u003cspan\u003e输出一行由空格分隔的n个整数a1\u003c/span\u003e\u003c/span\u003e a2,...,an(1≤ai≤$10^7$),表示可能的饥饿序列。\u003c/p\u003e \n \u003cp\u003e \u003cspan\u003e\u003cspan\u003e注意,每个ai不能大于10000000且不能小于1。\u003c/span\u003e\u003c/span\u003e\u003c/p\u003e \n \u003cp\u003e \u003cstrong\u003e如果有多个解决方案,您可以输出任何一个。即与样例输出不相同也有可能是正确的。\u003c/strong\u003e\u003c/p\u003e \n \u003c/div\u003e \n\u003c/div\u003e"}},{"title":"Sample Input","value":{"format":"HTML","content":"\u003cdiv\u003e \n \u003cdiv\u003e \n \u003cdiv\u003e \n \u003cdiv\u003e \n \u003cdiv\u003e \n \u003cspan\u003e\u003cspan\u003eInput1:\u003c/span\u003e\u003c/span\u003e\n \u003c/div\u003e \n \u003cdiv\u003e\n 3\n \u003c/div\u003e \n \u003c/div\u003e \n \u003cdiv\u003e \n \u003cdiv\u003e\n \u0026nbsp;\n \u003c/div\u003e \n \u003c/div\u003e \n \u003cdiv\u003e \n \u003cdiv\u003e \n \u003cspan\u003e\u003cspan\u003eInput2:\u003c/span\u003e\u003c/span\u003e\n \u003c/div\u003e \n \u003cdiv\u003e\n 5\n \u003c/div\u003e \n \u003cdiv\u003e\n \u0026nbsp;\n \u003c/div\u003e \n \u003c/div\u003e \n \u003c/div\u003e \n \u003c/div\u003e \n\u003c/div\u003e"}},{"title":"Sample Output","value":{"format":"HTML","content":"\u003cdiv\u003e \n \u003cspan\u003e\u003cspan\u003eOutput1:\u003c/span\u003e\u003c/span\u003e\n\u003c/div\u003e \n\u003cdiv\u003e\n 2 9 15\n\u003c/div\u003e \n\u003cdiv\u003e\n \u0026nbsp;\n\u003c/div\u003e \n\u003cdiv\u003e \n \u003cspan\u003e\u003cspan\u003eOutput2:\u003c/span\u003e\u003c/span\u003e\n\u003c/div\u003e \n\u003cdiv\u003e\n 11 14 20 27 31\n\u003c/div\u003e"}}]}