题解 | #尼科彻斯定理#

import java.util.Scanner;
public class Main {
    public static void main(String[] args) throws IOException {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int num = n*n*n;
        int[] arr = new int[n];
        for(int i=0;i<num;i++){
            int sum = 0;
            if(i%2 != 0){
                if(i==n*(n-1)+1){
                    for(int j=1;j<arr.length;j++){
                        arr[0]=i;
                        arr[j]=arr[j-1]+2;
                        sum +=arr[j];
                    }
                }
            }
            if(sum+i == num){
                for(int m=0;m<arr.length;m++){
                    if(m!=arr.length-1){
                        System.out.print(arr[m]+"+");
                    }else{
                        System.out.print(arr[m]);
                    }
                }
            }
        }
    }
}