题解 | #尼科彻斯定理#

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        while (sc.hasNext()) {
            int m = sc.nextInt();
            int sum = (int) Math.pow(m, 3);
            int first = sum / m - m + 1;
            StringBuilder sb = new StringBuilder(String.valueOf(first));
            for (int i = 1; i < m; i++) {
                sb.append("+").append(first + i * 2);
            }
            System.out.println(sb);
        }
        sc.close();
    }
}