import sys
from collections import deque, Counter
input = lambda: sys.stdin.readline().rstrip()
ii = lambda: int(input())
mi = lambda: map(int, input().split())
li = lambda: list(mi())
inf = 2 ** 63 - 1
mod = 998244353

n = ii()

a = [li() for _ in range(n)]
ans = 'Yes'
for i in range(n):
    for j in range(n):
        for k in range(n):
            if a[a[i][j]][k] != a[i][a[j][k]]:
                ans = 'No'

exist_e = -1
for e in range(n):
    f = True
    for j in range(n):
        if a[e][j] != j or a[j][e] != j:
            f = False
    if f:
        exist_e = e
if exist_e == -1:
    ans = 'No'

for i in range(n):
    f = False
    for j in range(n):
        if a[i][j] == a[j][i] == exist_e:
            f = True
    if not f:
        ans = 'No'
print(ans)