题解 | #尼科彻斯定理#

无脑流

n = int(input())
mid = (n ** 3) // n
left = 0
right = 0
res = []

if n % 2 == 0:
    left = mid - 1
    right = mid + 1
    res.append(left)
    res.append(right)
    while True:
        if len(res) < n:
            left -= 2
            right += 2
            res.append(left)
            res.append(right)
        else:
            break
else:
    res.append(mid)
    left = mid - 2
    right = mid + 2
    res.append(left)
    res.append(right)
    while True:
        if len(res) < n:
            left -= 2
            right += 2
            res.append(left)
            res.append(right)
        else:
            break
res.sort()
res = [str(x) for x in res]
print('+'.join(res))
# while True:
#     try:
#         n = int(input())
#         l = [i for i in range(1,n**3+1) if i%2 != 0 ]
#         for j in range(len(l)):
#             if sum(l[j:j+n]) == n**3 and len(l[j:j+n]) == n:
#                 print('+'.join(map(str,l[j:j+n])))
#     except:
#         break