{"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×n的整数方阵,满足以下条件。\u003c/p\u003e\n\u003cul\u003e\n\u003cli\u003e从0到(n\u003csup\u003e2\u003c/sup\u003e-1)(含)的所有整数在矩阵中精确出现一次。\u003c/li\u003e\n\u003cli\u003e一行或一列中所有元素的XOR,每行和每列的元素必须相同。\u003c/li\u003e\n\n\u003c/ul\u003e\n\u003cp\u003e给出一个整数n,它是4的倍数,构造一个大小为n×n的魔力网格。\u003c/p\u003e\n"}},{"title":"Input","value":{"format":"HTML","content":"输入的唯一一行包含一个整数n(4≤n≤1000)。保证n是4的倍数。"}},{"title":"Output","value":{"format":"HTML","content":"\u003cp\u003e打印一个神奇的网格,即n行,其中第i行包含n个空格分隔的整数,代表网格的第i行。\u003c/p\u003e\n\u003cp\u003e如果有多个答案,打印任意一个。我们可以证明,一个答案总是存在的。\u003c/p\u003e\n"}},{"title":"Examples","value":{"format":"HTML","content":"\u003cdiv class\u003d\"sample-test\"\u003e\n \u003cdiv class\u003d\"input\"\u003e\n \u003cdiv class\u003d\"title\"\u003e\n Input\n \u003c/div\u003e\n \u003cpre\u003e4\n\u003c/pre\u003e\n \u003c/div\u003e\n \u003cdiv class\u003d\"output\"\u003e\n \u003cdiv class\u003d\"title\"\u003e\n Output\n \u003c/div\u003e\n \u003cpre\u003e8 9 1 13\n3 12 7 5\n0 2 4 11\n6 10 15 14\u003c/pre\u003e\n \u003c/div\u003e\n \u003cdiv class\u003d\"input\"\u003e\n \u003cdiv class\u003d\"title\"\u003e\n Input\n \u003c/div\u003e\n \u003cpre\u003e8\n\u003c/pre\u003e\n \u003c/div\u003e\n \u003cdiv class\u003d\"output\"\u003e\n \u003cdiv class\u003d\"title\"\u003e\n Output\n \u003c/div\u003e\n \u003cpre\u003e19 55 11 39 32 36 4 52\n51 7 35 31 12 48 28 20\n43 23 59 15 0 8 16 44\n3 47 27 63 24 40 60 56\n34 38 6 54 17 53 9 37\n14 50 30 22 49 5 33 29\n2 10 18 46 41 21 57 13\n26 42 62 58 1 45 25 61\u003c/pre\u003e\n \u003c/div\u003e\n\u003c/div\u003e"}},{"title":"Note","value":{"format":"HTML","content":"\u003cp\u003e在第一个例子中,每行每列的XOR为13。\u003c/p\u003e\n\u003cp\u003e在第二个例子中,每行每列的XOR为60。\u003c/p\u003e\n"}}]}