import sys
INF = float('inf')
#10**20,2**63,float('inf')
MOD = 10**9 + 7
MOD2 = 998244353
#from collections import defaultdict
def solve():
    def II(): return int(sys.stdin.readline())
    def LI(): return list(map(int, sys.stdin.readline().split()))
    def LC(): return list(input())
    def IC(): return [int(c) for c in input()]
    def MI(): return map(int, sys.stdin.readline().split())
    N = II()
    if(N%2 == 1):
        print("No")
        exit()
    Ans = [[0]*N for _ in range(N)]
    for i in range(N):
        for j in range(N):
            if(i+j > N-1):
                Ans[i][j] = 2
            elif(i+j == N-1):
                if(i<=j):
                    Ans[i][j] = 1
                else:
                    Ans[i][j] = 2
    for i in range(N):
        print(*Ans[i],sep="")
    return
solve()
#sys.setrecursionlimit(10 ** 6)#再帰関数ではコメントにしないこと！！