{"trustable":true,"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\u003eDemetrio is working on a hard problem. He was given a sequence of $$$n\u003d2k+1$$$ integer numbers $$$$$$a_{-k},a_{-k+1},a_{-k+2},\\ldots, a_0,a_1,a_2,\\ldots,a_k$$$$$$ And he was asked to split this sequence as sum of two other sequences of integer numbers $$$b_{-k},\\ldots,b_k$$$ and $$$c_{-k},\\ldots,c_k$$$, in such a way that for each $$$-k\\leq i\\leq k$$$ the following equality holds: $$$$$$a_i\u003db_i+c_i$$$$$$ That was too easy for him, just choosing $$$b_i\u003d0$$$ and $$$c_i\u003da_i$$$ seemed to be a possible answer. However, his friend Penazzi added one more restriction. The sequences $$$b_{-k},\\ldots,b_k$$$ has to be an odd sequence and the sequence $$$c_{-k},\\ldots,c_k$$$ has to be even. This means: $$$$$$ b_i \u003d -b_{-i} \\;\\; \\forall i\\in [-k,k]$$$$$$ $$$$$$ c_i \u003d c_{-i} \\,\\;\\; \\forall i\\in [-k,k] $$$$$$\u003c/p\u003e\u003cp\u003ePlease help Demetrio to beat Penazzi by solving this problem. \u003c/p\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cp\u003eOne odd integer $$$n\u003d2k+1$$$, $$$1\\leq n\\leq 10^5$$$. Following $$$n$$$ numbers $$$a_{-k},\\ldots,a_k$$$, such that $$$|a_i|\\leq 10^9$$$ for all $$$i$$$.\u003c/p\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cp\u003eThe first line has to say \u003cspan class\u003d\"tex-font-style-tt\"\u003eNO\u003c/span\u003e if it\u0027s impossible to fulfill Penazzi\u0027s desire, or \u003cspan class\u003d\"tex-font-style-tt\"\u003eYES\u003c/span\u003e if it\u0027s possible. In that case, two lines must follow with $$$n$$$ numbers each. The first line consists of $$$b_{-k},\\ldots,b_k$$$ and the second of $$$c_{-k},\\ldots,c_k$$$\u003c/p\u003e"}},{"title":"Examples","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\u003e3\n1 2 3\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eYES\n-1 0 1 \n2 2 2 \n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}},{"title":"","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\u003e5\n-6 -2 1 3 5\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eNO\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}},{"title":"","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\u003e1\n19\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eYES\n0 \n19 \n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}