''' 坐标从(0,0)开始。 寻找a(i,j)值的递归关系式: a(0,0)=1。i>0时,a(i,0)=a(i-1,0)+i a(i,0)等于a(i-1,0)的值添加从a(0,0)到a(i,0)的路径长度。 同时: a(i,j)=a(i,j-1)+i+j+2 a(i,j)等于a(i,j-1)的值添加从a(0,0)到a(i,j)的路径长度+1. 第i行有n-i个元素。 ''' n = int(input()) a0 = 1 for i in range(n): a = a0 + i a0 = a print(a,end=' ') for j in range(n-i-1): a = a + i + j + 2 print(a,end=' ') print()