from itertools import *
from bisect import *
#from math import *
from collections import *
from heapq import *
from random import *
from decimal import *
import numpy as np
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def MI1(): return map(int1, sys.stdin.readline().split())
def MF(): return map(float, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LF(): return list(map(float, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
dij = [(0, 1), (1, 0), (0, -1), (-1, 0)]

def main():
    n=II()
    t=[[-1]*n for _ in range(n)]
    i=j=0
    dir=0
    di, dj = dij[dir]
    for a in range(1,n**2+1):
        t[i][j]=str(a).zfill(3)
        if a==n**2:break
        ni,nj=i+di,j+dj
        while ni<0 or ni>=n or nj<0 or nj>=n or t[ni][nj]!=-1:
            dir=(dir+1)%4
            di,dj=dij[dir]
            ni,nj=i+di,j+dj
        i,j=ni,nj
    for x in t:
        print(*x)

main()