from collections import *
from itertools import *
from functools import *
from heapq import *
import sys,math
input = sys.stdin.readline

N = int(input())

bef = 0
nxt = [(0,1),(1,0),(0,-1),(-1,0)]
    
A = [[-1]*N for _ in range(N)]

now = 1
nx,ny = 0,0
A[nx][ny] = str(now).zfill(3)
def is_ok(x,y):
    return (0<=x<N)&(0<=y<N)
while True:
    
    flg = True
    now += 1
    while True:
        
        dx,dy = nxt[bef]
        ix,iy = nx+dx,ny+dy
        if not is_ok(ix,iy):
            bef = (bef+1)%4
            continue
        
        if A[ix][iy]!=-1:
            bef = (bef+1)%4
            continue
        A[ix][iy] = str(now).zfill(3)
        nx,ny = ix,iy
        break
    if now == N**2:
        break
    
for i in range(N):
    print(*A[i])