题解 | #尼科彻斯定理#
尼科彻斯定理
https://www.nowcoder.com/practice/dbace3a5b3c4480e86ee3277f3fe1e85
m = int(input())
n = m*m - m + 1 #以n为首项，公差d=2，m个数字构成的等差数列。于是有：m^3 = m(n0 + nm)/2。化简后就有n = m*m - m + 1
l = map(str,[n+2*k for k in range(m)])
#print(l)
print('+'.join(l))
