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.buffer.readline())
def FI(): return float(sys.stdin.buffer.readline())
def MI(): return map(int, sys.stdin.buffer.readline().split())
def MF(): return map(float, sys.stdin.buffer.readline().split())
def MI1(): return map(int1, sys.stdin.buffer.readline().split())
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def LI1(): return list(map(int1, sys.stdin.buffer.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def BI(): return sys.stdin.buffer.readline().rstrip()
def SI(): return sys.stdin.buffer.readline().rstrip().decode()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
inf = 10**16
md = 998244353
# md = 10**9+7

n = II()
t = [[0]*n for _ in range(n)]
n2 = n//2

a = 1
i = j = 0
dj = 1
for _ in range(n*n2):
    t[i][j] = a
    a += 2
    j += dj
    if j == n2:
        dj = -1
        i += 1
        j = n2-1
    elif j == -1:
        dj = 1
        i += 1
        j = 0

a = 2
i = j = n2
dj = 1
for _ in range(n*n2):
    t[i][j] = a
    a += 2
    j += dj
    if j == n:
        dj = -1
        i += 1
        j = n-1
    elif j == n2-1:
        dj = 1
        i += 1
        j = n2
    if i == n:
        i = 0

for r in t:print(*r)