题解 | #尼科彻斯定理#

const rl = require("readline").createInterface({ input: process.stdin });
var iter = rl[Symbol.asyncIterator]();
const readline = async () => (await iter.next()).value;

void (async function () {
    // Write your code here
    while ((line = await readline())) {
        let number = parseInt(line);
        let square = number * number;
        let array = [];
        if (number % 2 !== 0) {
            array.push(square);
            for (let i = 1; i <= number / 2; i++) {
                array.push(square - 2 * i);
                array.push(square + 2 * i);
            }
        } else {
            for (let i = 0; i < number / 2; i++) {
                array.push(square - 1 - 2 * i);
                array.push(square + 1 + 2 * i);
            }
        }
        array.sort((a,b)=>(a-b));
        console.log(array.join("+"));
    }
})();