소스 코드 제출

# a=[]
# sum=0
# for i in range(4):
#     a.append(list(map(int,input().split())))
# d=[]
# for i in range(100) :
#     d.append([])
#     for j in range(100) :
#         d[i].append(0)
# for i in range(4):
#     for j in range(a[i][3]-a[i][1]):
#         for k in range(a[i][2]-a[i][0]):
#             d[19-(a[i][1]+j)][a[i][0]+k]=1
# for i in range(100):
#     for j in range(100):
#         if d[i][j]==1 :
#             sum=sum+1
# print(sum)

# n=int(input())
# d=[]
# for i in range(n) :
#     d.append([])
#     for j in range(n) :
#         d[i].append(0)
# a=0
# b=n//2
# d[a][b]=1
# for i in range(n*n-1):
#     if (1+i)%n==0 :
#         a=a+1
#     else :
#         a=a-1
#     if a<0:
#         a=a+n
#     if (1+i)%n!=0 :
#         b=b+1
#         if b>n-1:
#             b=b-n
#     d[a][b]=2+i
# for i in range(n):
#     for j in range(n):
#         print(d[i][j],end=' ')
#     print()

n=int(input())
d=[]
for i in range(n) :
    d.append([])
    for j in range(n) :
        d[i].append(0)
a=0
for i in range(n*n+1):
    for j in range(n):
        d[n-j-1][a+j]=j+1
    a=a+1
    n=n-1
    for k in range(n):
        d[a-k][n-k]=n+k+1
    a=a+1
    n=n-1
    if n==0 :
        break
print(d)