import numpy as np
n = int(input())
a = []
for i in range(n):
    a += input().split()
for i in range(len(a)):
    a[i] = int(a[i])
print(a)
m = []
for q1 in range(n):
    for q2 in range(n):
        m.append([0]*(n*n))
        for i in range(max(0, q1-1), min(n, q1+2)):
            for j in range(max(0, q2-1), min(n, q2+2)):
                m[q1*n+q2][i*n+j] = 1
print(m)

#aa = np.array(m)
#bb = np.array(a)
#ab = np.linalg.pinv(aa)
#ans = numpy.linalg.solve(aa, bb)

#k = 0
#for i in ans:
#    print(int(i), end=" ")
 #   k+=1
 #   if k % n == 0:
 #     k = 0
 #     print()
#mtr = m.transpose()