题解 | #HJ076 尼科彻斯定理#

import java.util.Scanner;

/**
 * HJ76 尼科彻斯定理 - 简单
 */
public class HJ076 {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        while (sc.hasNext()) {
            int n = sc.nextInt();
            int start = n * (n - 1) + 1;
            int end = n * (n + 1) - 1;
            for (int i = start; i <= end; i += 2) {
                if (i == end) {
                    System.out.println(i);
                } else {
                    System.out.print(i + "+");
                }
            }
        }
        sc.close();
    }

}