{"trustable":false,"prependHtml":"\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 async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS-MML_HTMLorMML\" type\u003d\"text/javascript\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"HTML","content":"\u003cscript type\u003d\u0027text/x-mathjax-config\u0027\u003eMathJax.Hub.Config({tex2jax: { inlineMath: [[\u0027$\u0027,\u0027$\u0027]] } }); \u003c/script\u003e\n\u003cscript type\u003d\u0027text/javascript\u0027 src\u003d\u0027https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.1/MathJax.js?config\u003dTeX-AMS-MML_HTMLorMML\u0027\u003e\u003c/script\u003e\n\u003cscript type\u003d\u0027text/javascript\u0027\u003esetTimeout(function(){MathJax.Hub.Queue([\u0027Typeset\u0027, MathJax.Hub, \u0027left_view\u0027]);}, 2000);\u003c/script\u003e\n\u003cdiv class\u003d\"panel_content\"\u003e\n \u003cp\u003e \n又到了一年一度的Ingress Field Art的时候了( 雾\u003c/p\u003e\n \u003cp\u003e\n这次Field Art的内容如下\u003c/p\u003e\n \u003cp\u003e\n一共有n个portal,每个portal上有个数字表示其等级,要求你把这n个portal连成一个环。当环里相邻的两个portal等级相加和为都为素数时,便找到一个环。( ap++ \u003cbr\u003e\n作为一位硬核蓝军,她希望找出所有可能的环。\n \u003cbr\u003e \n \u003cbr\u003eNote: 每个环的第一个portal的等级必须是1级 \u003cbr\u003e \n \u003cbr\u003e \n \u003cimg style\u003d\"max-width:100%;\" SRC\u003d\"CDN_BASE_URL/427b1dd2282412709d583cc17eda983e?v\u003d1533545405\"\u003e \n \u003cbr\u003e \n\u003c/div\u003e\n"}},{"title":"Input","value":{"format":"HTML","content":"n (0 \u0026lt; n \u0026lt; 20). \n\u003cbr\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cdiv\u003e\n\u003cp\u003e输出格式如下方输出样例所示。\u003c/p\u003e\n\u003cp\u003e每行一串数字表示一种环中 portal等级 的排列顺序。等级 的顺序必须满足:从1开始,顺时针或逆时针。按字典序输出所有解决方案。您将编写一个完成上述过程,帮助这位蓝军顺利完成找环的任务。\u003c/p\u003e\n\u003cp\u003e别忘了在每组方案后面输出一个空行。\u003c/p\u003e\n\u003c/div\u003e\n"}},{"title":"Sample Input","value":{"format":"HTML","content":"\u003cpre\u003e6\n8\u003c/pre\u003e"}},{"title":"Sample Output","value":{"format":"HTML","content":"\u003cpre\u003eCase 1:\n1 4 3 2 5 6\n1 6 5 2 3 4\n\nCase 2:\n1 2 3 8 5 6 7 4\n1 2 5 8 3 4 7 6\n1 4 7 6 5 8 3 2\n1 6 7 4 3 8 5 2\u003c/pre\u003e"}}]}