题解 | #尼科彻斯定理#

import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
import java.util.stream.Collectors;

public class Main {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);

        while (in.hasNextInt()) {
            int n = in.nextInt();

            for (int k = 1; ; k += 2) {
                List<Integer> subList = getSubList(k, n);
                int sum = subList.stream().mapToInt(e -> e).sum();
                if (sum == Math.pow(n, 3)) {
                    String collect = subList
                                     .stream()
                                     .map(String::valueOf)
                                     .collect(Collectors.joining("+"));

                    System.out.println(collect);
                    return;
                }
            }
        }
        in.close();
    }

    public static List<Integer> getSubList(int from, int size) {
        List<Integer> integers = new ArrayList<>();
        int first = from;
        for (int i = 0; i < size; i++) {
            integers.add(first);
            first += 2;
        }
        return integers;
    }
}