import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = (1 << 63)-1
# md = 10**9+7
md = 998244353

def ok():
    def ise(e):
        for i in range(n):
            if not aa[i][e] == aa[e][i] == i: return False
        for i in range(n):
            for j in range(n):
                if aa[i][j] == aa[j][i] == e: break
            else:
                return False
        return True

    n = II()
    aa = LLI(n)
    for i in range(n):
        for j in range(n):
            for k in range(n):
                a = aa[aa[i][j]][k]
                b = aa[i][aa[j][k]]
                if a != b: return False

    for i in range(n):
        if ise(i): return True

    return False

print("Yes" if ok() else "No")